hdu 4496 D-City

来源:互联网 发布:网络女生翻唱歌手 编辑:程序博客网 时间:2024/06/03 23:38

D-City

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


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.
 

题意:给你n个点m条边,问删除前i条边后有多少个连通分块。


思路:从后往前操作,从后往前添加i条边等于添加完m条边后删掉前m-i条边,可知刚开始没有边,所以sum[m]=n;

#include <iostream>using namespace std;const int Max=100010;int father[Max];int sum[Max];int Size[Max];int Find(int x){    while (x!=father[x])    {        x=father[x];    }    return x;}int main(){    int N,M;    while (scanf("%d%d",&N,&M)!=EOF)    {        int a[M];        int b[M];        for (int i=0; i<N; i++)        {            father[i]=i;            Size[i]=i;        <span style="font-family: 'Heiti SC Light';">//用于平衡树的大小</span>        }        sum[M]=N;        for (int i=1; i<=M; i++)        {            scanf("%d%d",&a[i],&b[i]);        }        for (int i=M; i>0; i--)        {            int fx=Find(a[i]);            int fy=Find(b[i]);            if(fx==fy)            {                sum[i-1]=sum[i];            }            else            {                sum[i-1]=sum[i]-1;                if(Size[fx]>Size[fy])                     {                    father[fy]=fx;                    Size[fx]+=Size[fy];                }                else                {                    father[fx]=fy;                    Size[fy]+=Size[fx];                }            }        }        for (int i=1; i<=M; i++)        {             printf("%d\n",sum[i]);        }    }    return 0;}


0 0
原创粉丝点击