hdu4496 D-City 判断两元素是否在同一集合
来源:互联网 发布:淘宝客服专用语言 编辑:程序博客网 时间:2024/06/14 16:54
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
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.
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.
5 10 0 1 1 2 1 3 1 4 0 2 2 3 0 4 0 3 3 4 2 4
1
1
1
2
2
2
2
3
4
5
思路:从输入的m条边倒着数,
若删完,结果应为n。
从下往上,添加边,若两点不在一个集合中,结果--;
若删完,结果应为n。
从下往上,添加边,若两点不在一个集合中,结果--;
注意:题目没说是一组还是多组用例,这就很尴尬了。
经测验是多组用例。。。。
还有注意数组越界问题,题目n,m范围,以及城市编号是从0到n-1
经测验是多组用例。。。。
还有注意数组越界问题,题目n,m范围,以及城市编号是从0到n-1
#include <cstdio>#include <algorithm>#define N 10005#define M 100050using namespace std;int n, m;int a[M], b[M];int ans[M];int f[N];void init(){for (int i = 0; i < n; i++)f[i] = i;}int find(int x){return x == f[x] ? x : f[x] = find(f[x]);}int merge(int x, int y){int t1, t2;t1 = find(x); t2 = find(y);if (t1 != t2){f[t2] = t1;return 1;}return 0;}int main(){while (scanf("%d%d", &n, &m) != EOF){for (int i = 0; i < m; i++)scanf("%d%d", &a[i], &b[i]);init();int tmp = n;for (int i = m - 1; i >= 0; i--){ans[i] = tmp;if (find(a[i]) != find(b[i]))//当前两城镇不连通tmp--;merge(a[i], b[i]);//连接两城镇}for (int i = 0; i < m; i++)printf("%d\n", ans[i]);}return 0;}
0 0
- hdu4496 D-City 判断两元素是否在同一集合
- hdu4496 D-City
- hdu4496 D-City
- HDU4496 D-City
- D-City(HDU4496)
- hdu4496 D-City(并查集删边)
- hdu4496 D-City(反向并查集啊 )
- hdu4496--D.City(并查集)
- HDU4496 D-City【并查集】
- hdu4496 D-City 并查集
- hdu4496 D-City 并查集
- hdu4496 D-City 并查集
- HDU4496 D-City并查集逆向推理
- HDU4496 D-City(并查集逆向思维)
- 判断一个元素是否在一个集合中
- 如何判断计算机是否在同一网段?
- 判断两个IP是否在同一网段
- 判断两序列是否为同一二叉搜索树序列
- 一箭多雕
- hdoj 1045 Fire Net (dfs or 匈牙利)
- Day 17 Hibernate
- 总结的堆和gc算法的网站
- 我的理解-android的事件分发
- hdu4496 D-City 判断两元素是否在同一集合
- 机器学习(一):KNN算法
- 文章标题
- JAVA基础知识面试题集
- TreeDp POJ2342 Anniversary party
- Causal Inference 学习(一):Assignment Mechanism
- 欢迎使用CSDN-markdown编辑器
- 二层转发和三层交换
- vfp 使用 .Net 系统自带的组件