HDU 4496D-City2013通化邀请赛D题(并查集需要压缩路径)-CSDN博客

本文链接：https://blog.csdn.net/coraline_m/article/details/10285811

本文探讨了在城市D中，当敌人Luxer摧毁特定数量的连接线后，剩余连接块的数量变化情况。通过并查集算法处理边的连接情况，计算在每次边被删除后，剩余的连接块数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D-City

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

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

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吉林通化全国邀请赛——题目重现

题目大意：给你n个顶点，m条边。每次会摧毁一条边，到最后把m条边都摧毁完。问你每次摧毁的时候还有几个集合。

解题思路：边会逐渐摧毁，我们关心的是点上还连着多少边。摧毁1条边还有m-1条边，摧毁2条边还有m-2条边。我们可以直接使用并查集处理，从后往前处理，依次加上第m条边，第m-1条边。这样处理即可。不过需要在找father的时候压缩路径，不然会TLE详见代码。

题目地址：D-City

AC代码：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=100005;
int a[maxn],b[maxn],father[maxn],res[maxn],n,cnt;

void init()
{
    int i;
    for(i=0;i<n;i++)
        father[i]=i;
}

int find1(int x)  //路径压缩的find1
{
    if(father[x]!=x)
    father[x]=find1(father[x]);
    return father[x];
}

/*int find1(int x)  //不压缩路径会TlE
{
   int r=x;
   while(father[r]!=r)
       r=father[r];
   return r;
}*/

void merge1(int p1,int p2)
{
    int s1=find1(p1);
    int s2=find1(p2);
    if(s1!=s2) cnt--;  //若有合并的集合就减少
    father[s1]=s2;
}

int main()
{
    int m,i;
    while(~scanf("%d%d",&n,&m))
    {
        init();
        cnt=n;
        for(i=0;i<m;i++)
            scanf("%d%d",&a[i],&b[i]);
        res[m]=cnt;
        for(i=m-1;i>=1;i--)  //逆序加边
        {
            merge1(a[i],b[i]);
            res[i]=cnt;
        }

        for(i=1;i<=m;i++)
            printf("%d\n",res[i]);
    }
    return 0;
}