hdu 1213 How Many Tables
2012-07-26 15:04
357 查看
点击打开链接
并查集 #include"stdio.h" int set[1005]; int find(int x) { int r; r=x; while(set[r]!=r) r=set[r]; return r; } void merge(int x,int y) { int f1,f2; f1=find(x); f2=find(y); if(f1!=f2) set[f1]=f2; } int main() { int t,n,m,x,y,i,count; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(i=1;i<=n;i++) set[i]=i; for(i=0;i<m;i++) { scanf("%d%d",&x,&y); merge(x,y); } count=0; for(i=1;i<=n;i++) if(set[i]==i) count++; printf("%d\n",count); } return 0; }
相关文章推荐
- hdu 1213 How Many Tables
- How Many Tables HDU - 1213 (简单并查集)
- 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
- How Many Tables HDU - 1213
- 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
- HDU 1213 How Many Tables
- HDU1213 How Many Tables
- HDU 1213 how many tables
- 【hdu 1213】How Many Tables
- HDU 1213 How Many Tables
- Hdu 1213 How Many Tables