题目:
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
题意:
就是找最小连通路径 直接使用并查集模板即可
1 #include<iostream> 2 3 using namespace std; 4 5 int t,n,m,a,b,ans,pre[1010],cnt[1010]; // 存 放 6 7 void init(){ 8 for(int i=0;i<=n;i++){ 9 pre[i]=i; 10 cnt[i]=1; //是否有桌子 11 } 12 } 13 14 int find(int x){ 15 if(x==pre[x]){ 16 return x; 17 } 18 return find(pre[x]); 19 } 20 21 //完整版 22 //int find(int x){ 23 // if(x==pre[x]){ 24 // return pre[x]; 25 // } 26 // else return pre[x]=find(pre[x]); 27 //} 28 29 void join(int x,int y){ 30 int xx=find(x); 31 int yy=find(y); 32 if(xx!=yy){ 33 pre[xx]=yy; 34 cnt[xx]=0; 35 } 36 } 37 38 39 int main(){ 40 cin>>t; 41 while(t--){ 42 cin>>n>>m; 43 init(); 44 for(int i=0;i<m;i++){ 45 cin>>a>>b; 46 join(a,b); 47 } 48 ans=0; 49 for(int i=1;i<=n;i++){ 50 if(cnt[i]!=0) ans++; 51 } 52 cout<<ans<<endl; 53 } 54 return 0; 55 }