hdu 1213 并查集
2017-10-04 20:26
344 查看
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=1005; int fa[maxn]; int find(int num) { if(fa[num]==num) return num; return fa[num]=find(fa[num]); } int main() { int t,a,b,i,ans,n,m; char ch; scanf("%d",&t); while(t--&&scanf("%d%d",&n,&m)!=EOF) { for(i=1;i<=n;i++) fa[i]=i; ans=n; for(i=0;i<m;i++) { scanf("%d%d",&a,&b); int sa=find(a),sb=find(b); if(sa!=sb) { ans--; fa[sa]=sb; } } 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 [并查集]
- HDU 1213 How Many Tables(并查集模板)
- [ACM] hdu 1213 How Many Tables(并查集)
- hdu 1213 How Many Tables 并查集模板题+路径压缩
- HDU 1232 & 1213并查集应用 练习
- 并查集之求连通块的数量 HDU - 1213 How Many Tables
- 【HDU 1213】How many tables(并查集模板)
- How Many Tables HDU - 1213 (简单并查集)
- HDU - 1213 dfs求联通块or并查集
- [ACM] hdu 1213 How Many Tables(并查集)
- HDU - 1213 How Many Tables(并查集)
- HDU 1213 How Many Tables 【并查集】
- HDU 1213 How Many Tables,并查集
- hdu 1213 求连通分量(并查集模板题)
- HDU 1213 How Many Tables(并查集入门模板题)