hdu 4496 并查集的变形
来源:互联网 发布:2016淘宝模特红人 编辑:程序博客网 时间:2024/05/16 09:43
D-City
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1055 Accepted Submission(s): 404
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.
Source
2013 ACM-ICPC吉林通化全国邀请赛——题目重现
Recommend
liuyiding | We have carefully selected several similar problems for you: 4822 4821 4820 4819 4818
这个题目其实可以倒过来想,假设之前都没联系,然后一个个加,最后倒着输出来就ok了
#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define N 10005#define M 100005int n,m;int f[N],x[M],y[M];int map[M];int find(int x){ return x == f[x] ? x : f[x] = find(f[x]);}int main(){ int i,j,k; while(scanf("%d%d",&n,&m)!=EOF) { for(i=0;i<n;i++) { f[i]=i; } for(i=0;i<m;i++) { scanf("%d%d",&x[i],&y[i]); } int ans=n; for(i=m-1;i>=0;i--) { map[i]=ans; int p=find(x[i]); int q=find(y[i]); if(p!=q) { f[q]=p; ans--; } } for(i=0;i<m;i++) { printf("%d\n",map[i]); } } return 0;}
0 0
- hdu 4496 并查集的变形
- 并查集变形
- HDU 3234 Exclusive-OR 并查集变形
- hdu 3635(并查集+路径压缩变形)
- 并查集变形 - 敌人
- poj 1611(简单并查集的变形)
- NEFU 679 (并查集的一个变形)
- Find them, Catch them(并查集的变形)
- HDOJ 4496 D-City(并查集变形,逆序 删边)
- hdu 4496 并查集
- hdu 4496(并查集)
- HDU 4496 并查集
- hdu-4496-并查集
- [并查集] HDU 4496
- zoj3261 并查集---略有变形
- hdu1181(变形课)-并查集
- 变形课(并查集)
- 【POJ1456】【并查集变形】【技巧】
- 基于Linux路由的访问控制
- 求指教,Android 如何调用系统主界面Launcher应用程序列表界面
- 胖子小的百宝袋
- spring tx标签
- 如何提高团队管理能力1
- hdu 4496 并查集的变形
- 社会网络分析工具
- <s:iterator>的status属性---转 柚子之心
- 【通知】计科1111-1114班《算法》第8周作业发布时间推迟到第9周,请见谅
- 自启动技术
- 《数据结构与算法(java语言版)第2版 Adam Drozdek著》排序的代码
- RGB排序
- github 配置
- say hello