感染者(并查集入门)
2012-10-17 20:13
239 查看
#include <iostream> #include <cstdio> #include <cstring> #define maxsize 30010 using namespace std; typedef struct tree1{ int pre; int num; }Tree; Tree tree[maxsize]; int find(int x){ if(tree[x].pre == x){ return x; } return (tree[x].pre = find(tree[x].pre)); } void merge(int x, int y){ int f1 = find(x); int f2 = find(y); if(f1!=f2){ tree[f1].num += tree[f2].num; tree[f2].pre = f1; } } int main() { int m, n, i, j, k; while(scanf("%d%d",&n, &m)!=EOF){ if(0==n&&0==m){ break; } for(i = 0; i < n; i++){ tree[i].pre = i; tree[i].num = 1; } while(m--){ scanf("%d", &k); int a, b; scanf("%d", &a); for(i = 1; i < k; i++){ scanf("%d", &b); merge(a,b); } } int t = find(0); printf("%d\n", tree[t].num); } return 0; } /* 100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0 */ http://acm.hrbeu.edu.cn/index.php?act=problem&id=1003&cid=50
相关文章推荐
- Ubiquitous Religions 并查集入门
- 【HDU1512】Monkey King-左偏树+并查集(左偏树入门题)
- LA3027 Corporative Network 带权并查集入门
- 带权并查集入门
- 并查集--(初学,入门)
- 并查集入门(小希的迷宫)
- 20131029: 并查集; 树与森林入门
- 算法笔记之 并查集入门 POJ 1611
- Tree - NHIP第三题解题报告 - 并查集入门练习
- 并查集入门--hd 1863
- ZSC 1155 ZQU_ACM 协会 (并查集入门)
- hdu1213How Many Tables(并查集入门)
- 并查集入门水题练习
- POJ2236(并查集入门)
- 并查集--(初学,入门)
- 并查集入门(hdu1272)
- 并查集入门(转)
- 并查集—入门
- poj 2524 并查集入门
- SDJZUOJ 1032 一家人(并查集入门)