hdu——1213——How Many Tables

发布时间:2017-1-18 21:57:35 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"hdu——1213——How Many Tables",主要涉及到hdu——1213——How Many Tables方面的内容,对于hdu——1213——How Many Tables感兴趣的同学可以参考一下。

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 #include <iostream> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; int father[1200]; int find(int x) { if(x!=father[x]) x=find(father[x]); return x; } int main() { int t; scanf("%d",&t); while(t--) { int n,m; int count=0; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { father[i]=i; } for(int i=1;i<=m;i++) { int a,b; scanf("%d%d",&a,&b); int tx=find(a); int ty=find(b); if(tx!=ty) father[ty]=tx; } for(int i=1;i<=n;i++) { int a=find(i); if(a==i) count++; } printf("%d\n",count); } return 0; }

下一篇:[置顶] 基于mdrill的大数据分析