HDU 1213
来源:互联网 发布:手机刷软件 编辑:程序博客网 时间:2024/06/02 16:58
A - How Many Tables
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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>#include<cmath>
#include<queue>
#include<iostream>
using namespace std;
int f[1111],a,b,c,m,n;
int find(int x)
{
while(x!=f[x])x=f[x];
return x;
}
int main()
{
int t;cin>>t;
while(t--)
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
f[i]=i;
}
for(int i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
a=find(a);
b=find(b);
f[b]=a;
}
int cnt=0;
for(int i=1;i<=n;i++)
{
if(i==f[i])cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
0 0
- HDU 1213
- HDU 1213
- HDU 1213
- HDU 1213
- HDU 1213
- hdu 1213
- hdu 1213
- HDU 1213
- HDU 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu(1213)
- HDU 1213
- hdu 1213
- HDU 1213
- JVM原理_内存篇
- effective c++ 记录之对象切割问题
- Poj 1860 Currency Exchange(贝尔曼福特,最长路)
- JUnit4执行cases背后的故事(1)---JUnitCore源码分析
- [华为机试练习题]4.简单密码破解
- HDU 1213
- jetty运行项目
- leetcode - Jump Game II
- Java基础:泛型及其擦除性、不可协变性
- CC2530_温湿度_串口通信
- 一个用 C 语言写的迷你版 2048 游戏,只有 500个字符
- SQL注入的攻击与防御(简单篇)
- ubuntu苹果主题
- 2015个人书单