hdu how many tables
来源:互联网 发布:金融数据终端 编辑:程序博客网 时间:2024/04/29 17:33
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
25 31 22 34 55 12 5
Sample Output
24----------------------------------------第一道并查集;#include<stdio.h>#include<string.h>int a[1010];int f(int n){ if(a[n]!=n) a[n] = f(a[n]); else return a[n]; //while(n!=a[n]) ///{ // a[n] = a[a[n]]; // n = a[n]; //} //return n;}int main(){ int t,n,m,count; int per1,per2; int i,j,k,x,y; scanf("%d",&t); while(t--) { scanf("%d %d",&n,&m); for(i=1;i<=n;i++) a[i]=i; for(i=0;i<m;i++) { scanf("%d %d",&per1,&per2); x = f(per1); y = f(per2); if(x!=y) a[y] = x; } count=0; for(i=1;i<=n;i++) { if(f(i)==i) count++; } printf("%d\n",count); } //while(1); return 0;}
0 0
- hdu How Many Tables
- HDU How Many Tables
- HDU How Many Tables
- hdu how many tables
- How Many Tables HDU
- How Many Tables HDU
- HDU-How Many Tables
- How Many Tables HDU
- How Many Tables(HDU
- How Many Tables HDU
- How Many Tables HDU
- HDU 1273 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
- 2014.8.5毕业后工作第一个月
- ListView点击头排序
- repo init - gpg: 无法检查签名:找不到公钥
- C++ 构造转换函数和强制转换函数
- shell-自动更改LINUX服务器IP
- hdu how many tables
- 屌丝程序员赚钱之道之taobao 2
- 如何在linux下查看电脑硬件设备属性
- python 功能函数
- 如何在Android平台上使用JS直接调用Java方法
- java 日期(Date DateFormat Calendar)
- ubuntu 中eclipse 无法找到系统标准头文件
- 工作日志
- js 得到某一天是星期几 和 得到某一天的前一天、后一天