hdu 4496(并查集的边删除)
来源:互联网 发布:银行证券软件下载 编辑:程序博客网 时间:2024/06/06 22:58
D-City
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
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.
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.
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 5HintThe 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.
解题思路:这道题看似删除边要重新构图,但实际上如果反着想就很明白了,按照输入边的逆序去建图,不就变得很简单了嘛。。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int maxn = 10005;struct Edge{int u,v;}edge[100005];int n,m,block,fa[maxn],ans[100005];int find(int x){if(fa[x] == x) return x;return fa[x] = find(fa[x]);}int main(){while(scanf("%d%d",&n,&m)!=EOF){for(int i = 1; i <= m; i++)scanf("%d%d",&edge[i].u,&edge[i].v);for(int i = 0; i < n; i++) fa[i] = i;block = n;ans[m] = block;for(int i = m; i > 1; i--){int u = edge[i].u;int v = edge[i].v;if(find(u) != find(v)){fa[find(v)] = find(u);block--;}ans[i-1] = block;}for(int i = 1; i <= m; i++)printf("%d\n",ans[i]);}return 0;}
0 0
- hdu 4496(并查集的边删除)
- HDU 2473 并查集的删除
- hdu 2473 并查集的删除关系
- HDU-2473 Junk-Mail Filter 并查集的删除
- Hdu 2473 Junk-Mail Filter (并查集的删除)
- hdu 2473 Junk-Mail Filter (并查集的删除)
- *hdu2473 (并查集的删除)
- hdu2473(并查集的删除)
- HDU 2473 删除并查集(装逼遭天谴)
- hdu 2473 (并查集 删除操作)
- hdu 2473(并查集+删除操作)
- 并查集的删除
- hdu 2473 Junk-Mail Filter(删除节点操作的并查集)
- HDU-2473 Junk-Mail Filter(并查集的删除)
- hdu 4496 并查集的变形
- hdu 4496 并查集
- hdu 4496(并查集)
- HDU 4496 并查集
- 项目管理工具---maven
- string类的常用的几个小东西find,substr
- 穿过已知点画平滑曲线(3次贝塞尔曲线)
- nutch源代码阅读心得
- 设计模式之观察者模式
- hdu 4496(并查集的边删除)
- Android通知代码
- Android Studio使用gradle打包指定包名和类的jar
- 使用WebRTC搭建前端视频聊天室——入门篇
- 关于oracle实例即localhost:1521/orcl中的orcl
- sql server常用函数
- 论Android网络请求库——android-async-http
- 线性代数中向量、矩阵深度理解(PartI)
- MFC中SetFont(CFont *font)方法容易出错点