How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17411 Accepted Submission(s):
8527
点我
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.
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
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 int f[1000]; 5 int find(int x)//查找x的祖先结点 6 { 7 while(x!=f[x]) 8 x=f[x]; 9 return x; 10 } 11 int merge(int x,int y) 12 { 13 int fx,fy; 14 fx=find(x); 15 fy=find(y); 16 if(fx!=fy)//判断他们是不是在一个集合里 17 f[fx]=fy;//合并 18 } 19 int main() 20 { 21 int n; 22 freopen("in.txt","r",stdin); 23 cin>>n; 24 while(n--) 25 { 26 int num,i,j,rel,a,b,count=0; 27 cin>>num>>rel; 28 for(i=1;i<=num;i++) 29 f[i]=i; 30 for(i=0;i<rel;i++) 31 { 32 cin>>a>>b; 33 merge(a,b); 34 } 35 for(i=1;i<=num;i++) 36 { 37 if(f[i]==i) 38 count++; 39 } 40 if(n!=0) 41 getchar(); 42 cout<<count<<endl; 43 } 44 }