hdu4496 D-City(并查集删边)

D-City

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 2128    Accepted Submission(s): 749


Problem Description
Luxer is a really bad guy. He destroys everything he met.
One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects exactly two D-points. Luxer will destroy all the D-lines. The mayor of D-city wants to know how many connected blocks of D-city left after Luxer destroying the first K D-lines in the input.
Two points are in the same connected blocks if and only if they connect to each other directly or indirectly.
 

Input
First line of the input contains two integers N and M.
Then following M lines each containing 2 space-separated integers u and v, which denotes an D-line.
Constraints:
0 < N <= 10000
0 < M <= 100000
0 <= u, v < N.
 

Output
Output M lines, the ith line is the answer after deleting the first i edges in the input.
 

Sample Input
 
  
5 10 0 1 1 2 1 3 1 4 0 2 2 3 0 4 0 3 3 4 2 4
 

Sample Output
 
  
1 1 1 2 2 2 2 3 4 5
Hint
The graph given in sample input is a complete graph, that each pair of vertex has an edge connecting them, so there's only 1 connected block at first. The first 3 lines of output are 1s because after deleting the first 3 edges of the graph, all vertexes still connected together. But after deleting the first 4 edges of the graph, vertex 1 will be disconnected with other vertex, and it became an independent connected block. Continue deleting edges the disconnected blocks increased and finally it will became the number of vertex, so the last output should always be N.
 

Source
2013 ACM-ICPC吉林通化全国邀请赛——题目重现 
/*
加油!!!
Time:2015-4-23 16:44
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=100000+10;
struct Node{
    int u,v;
}edge[MAX];
bool g[10000+10];
int n,m;
int father[MAX];
void Init(){
    for(int i=0;i<=n;i++){
        father[i]=i;
    }
}
int Find(int x){
    return father[x]==x?x:father[x]=Find(father[x]);
}
int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        int u,v;
        Init();
        for(int i=0;i<m;i++){
            scanf("%d%d",&u,&v);
            edge[i].u=u;edge[i].v=v;
        }
        int ans[MAX];
        ans[m]=n;
        for(int i=m-1;i>=1;i--){
            u=edge[i].u; v=edge[i].v;
            int t1=Find(u);
            int t2=Find(v);
            if(t1!=t2){//原来不在同一块的话,连到一块会减少一
                ans[i]=ans[i+1]-1;
                father[t2]=t1;
            }else{
                ans[i]=ans[i+1];//原来在一块,不变
            }
        }
        for(int i=1;i<=m;i++){
            printf("%d\n",ans[i]);
        }

    }
return 0;
}

猜你喜欢

转载自blog.csdn.net/u013634213/article/details/45223655