###### 并查集1.0(找集合个数 hdu 1232 1213)

hdu1232畅通工程

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 49430 Accepted Submission(s): 26379

Problem Description

Input

3 3
1 2
1 2
2 1

Output

Sample Input
4 2
1 3
4 3
3 3
1 2
1 3
2 3
5 2
1 2
3 5
999 0
0
Sample Output
1
0
2
998

 /*************************************************************************
> File Name: hdu1232.cpp
> Author:ukiy
> Mail:
> Created Time: 2017年01月04日 星期三 06时24分54秒
************************************************************************/

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<map>
#include<queue>
#define rep(i,a,b) for(int i=(a);i<=(b);(i++))
#define inf 0x3f3f3f
#define ll long long
#define pi acos(-1)
int dire[4][2]={ {0,1},{1,0},{0,-1},{-1,0} };
int dire2[8][2]={{-1,-1},{-1,0},{-1,1},{ 0,-1},{ 0,1},{ 1,-1},{ 1,0},{ 1,1}};
int dire3[6][3]={ {0,0,1},{0,1,0},{1,0,0},{0,0,-1},{0,-1,0},{-1,0,0} };
using namespace std;
int n,m;
int tot;
int pre[1005];
void init(){
rep(i,0,n){
pre[i]=i;
}
}
int find(int x){
int r=x;
while(pre[r]!=r){
r=pre[r];
}
int i=x;
while(i!=r){
int t=pre[i];
pre[i]=r;
i=t;
}
return r;
}
void join(int x,int y){
int fx=find(x),fy=find(y);
if(fx!=fy){
pre[fx]=fy;
tot--;
}
}

int main()
{
std::ios::sync_with_stdio(false);
//freopen("in.txt","r",stdin);
while(cin>>n>>m){
if(n==0) break;
init();
tot=n-1;
rep(i,1,m){
int x,y;
cin>>x>>y;
join(x,y);
}
cout<<tot<<endl;
}
return 0;
}


hdu1213 How Many Tables

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26536 Accepted Submission(s): 13199

Problem Description
Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

Input
The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.

Output
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

Sample Input
2
5 3
1 2
2 3
4 5

5 1
2 5

Sample Output
2
4

 /*************************************************************************
> File Name: hdu1213.cpp
> Author:ukiy
> Mail:
> Created Time: 2017年01月04日 星期三 07时09分57秒
************************************************************************/

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<map>
#include<queue>
#define rep(i,a,b) for(int i=(a);i<=(b);(i++))
#define inf 0x3f3f3f
#define ll long long
#define pi acos(-1)
int dire[4][2]={ {0,1},{1,0},{0,-1},{-1,0} };
int dire2[8][2]={{-1,-1},{-1,0},{-1,1},{ 0,-1},{ 0,1},{ 1,-1},{ 1,0},{ 1,1}};
int dire3[6][3]={ {0,0,1},{0,1,0},{1,0,0},{0,0,-1},{0,-1,0},{-1,0,0} };
using namespace std;
int n,m;
int tot;
int pre[1005];
void init(){
rep(i,0,n){
pre[i]=i;
}
}
int find(int x){
int r=x;
while(r!=pre[r]){
r=pre[r];
}
int i=x;
while(i!=r){
int t=pre[i];
pre[i]=r;
i=t;
}
return r;
}
void join(int x,int y){
int fx=find(x),fy=find(y);
if(fx!=fy){
pre[fx]=fy;
tot--;
}
}
int main()
{
std::ios::sync_with_stdio(false);
//freopen("in.txt","r",stdin);
int T;
cin>>T;
while(T--){
cin>>n>>m;
init();
tot=n;
rep(i,1,m){
int x,y;
cin>>x>>y;
join(x,y);
}
cout<<tot<<endl;
}
return 0;
}


#### HDU - 1213 dfs求联通块or并查集

2017-03-11 22:38:21

#### HDU1232——畅通工程（并查集）

2015-12-04 18:32:12

#### 并查集_hdu1213

2017-04-12 18:59:47

#### ACM-并查集之畅通工程——hdu1232

2014-04-16 09:21:28

#### HDU1232 畅通工程 并查集

2012-06-25 11:03:30

#### 杭电ACM1213（并查集）

2015-11-29 16:55:52

#### HDU--1213并查集

2015-09-14 19:33:17

#### HDU1213_并查集

2015-03-24 21:49:30

#### 并查集求集合的个数

2015-09-22 23:37:13

#### HDU/HDOJ 1232 超详细题解（并查集入门教程）

2015-08-05 14:29:28