2018 华中科技大学校赛 L Fresh Air 思维BFS

最新推荐文章于 2018-10-12 23:11:00 发布

DlPF_C

最新推荐文章于 2018-10-12 23:11:00 发布

阅读量489

点赞数

分类专栏：简单搜索

本文链接：https://blog.csdn.net/dlpf_c/article/details/80148203

版权

简单搜索专栏收录该内容

11 篇文章 0 订阅

订阅专栏

链接：https://www.nowcoder.com/acm/contest/106/L
来源：牛客网

It’s universally acknowledged that there’re innumerable trees in the campus of HUST.

And you know that, trees have the special ability to refresh the air. If an area, which is surrounded by trees, is separated from the outer atmosphere, you can call it “the supercalifragilisticexpialidocious area”. Students can enjoy the healthiest air there. Then, you happened to know that HUST will plant N trees in a bare plain, so you want to calculate the total size of “the supercalifragilisticexpialidocious area” after each operation.

We describe the position of trees with a coordinate.(X _i,Y _i).

For example, after 9 trees were planted, the green area is a supercalifragilisticexpialidocious area, its size is 3.

After planting a new tree in (3,2), its size is 2.

输入描述:

The first line is an integer N

as described above.

Then following N lines, each line contains two integer X _i and Y _i, indicating a new tree is planted at (X _i,Y _i)

输出描述:Output N lines, each line a integer indicating the total size of supercalifragilisticexpialidocious areas after each operation.示例1输入90 11 02 02 11 23 22 3100 1001 1输出000011221

倒着BFS，先把树种好，然后每拔一棵树，判断封闭是否被打破。

#include<bits/stdc++.h>
#define maxn 100010
#define ll long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
int M[2010][2010];
 
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int ans[maxn];
int Ans;
struct node
{
    int x,y;
};
 
void bfs(int x,int y)
{
    node nod;
    nod.x=x;
    nod.y=y;
    //cout<<nod.x<<" "<<nod.y<<endl;
    M[nod.x][nod.y]=2;
    queue<node> q;
    q.push(nod);
    Ans--;
    while(q.size())
    {
        nod=q.front();
        q.pop();
        for(int i=0;i<4;i++)
        {
            node nnod;
            nnod.x=nod.x+dx[i];
            nnod.y=nod.y+dy[i];
            if(nnod.x>=0&&nnod.x<=2000&&nnod.y>=0&&nnod.y<=2000&&M[nnod.x][nnod.y]==0)
            {
                Ans--;
                M[nnod.x][nnod.y]=2;
                q.push(nnod);
            }
        }
    }
}
int main()
{
    int x[maxn],y[maxn];
    //memset(M,0,sizeof(M));
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>x[i]>>y[i];
        x[i]+=1000;
        y[i]+=1000;
        M[x[i]][y[i]]=1;
    }
    Ans=2001*2001-n;
    bfs(0,0);
    for(int i=n-1;i>=0;i--)
    {
        ans[i]=Ans++;
        M[x[i]][y[i]]=0;
        for(int j=0;j<4;j++)
        {
            int nx=x[i]+dx[j];
            int ny=y[i]+dy[j];
            if(nx>=0&&nx<=2000&&ny>=0&&ny<=2000&&M[nx][ny]==2)
            {
                bfs(x[i],y[i]);
                break;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        cout<<ans[i]<<endl;
    }
    return 0;
}