hdu 1213 How Many Tables(并查集求无向图有几个连通分量)
2017-04-13 20:17
573 查看
代码:
#include<cstdio> #include<cstring> using namespace std; int n,m; int father[1005]; int Find(int a) { int r=a; while(father[a]!=a) { a=father[a]; } father[r]=a; return a; } void Union(int a,int b) { a=Find(a); b=Find(b); if(a!=b) father[b]=a; } int main() { int t; scanf("%d",&t); while(t--) { int ans=0; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { father[i]=i; } for(int i=1;i<=m;i++) { int a,b; scanf("%d%d",&a,&b); Union(a,b); } for(int i=1;i<=n;i++) { father[i]=Find(i); if(father[i]==i) ans++; } printf("%d\n",ans); } return 0; }
相关文章推荐
- hdu 1213 How Many Tables(并查集求无向图有几个连通分量)
- HDU 1213 How Many Tables 并查集
- HDU 1213 How Many Tables 并查集
- HDU 1213 How Many Tables(并查集)
- HDU 1213 How Many Tables 并查集入门
- HDU 1213 How Many Tables,并查集
- Hdu1213 - How Many Tables - 并查集
- HDU - 1213 How Many Tables (简单并查集)
- hdu 1213 How Many Tables(并查集学习)
- [ACM] hdu 1213 How Many Tables(并查集)
- 杭电hdu 1213 How Many Tables并查集
- HDU--1213--How Many Tables--并查集
- HDU-#1213 How Many Tables (并查集)
- HDU1213 How Many Tables(简单的并查集)
- HDU 1213 How Many Tables 并查集 水~
- [ACM] hdu 1213 How Many Tables(并查集)
- HDU 1213 How Many Tables(并查集)
- hdu 1213 How Many Tables(并查集~~)
- HDU 1213 How Many Tables 并查集 水~