HDOJ 1213 How Many Tables
来源:互联网 发布:天刀成女脸型数据 编辑:程序博客网 时间:2024/04/30 03:21
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20076 Accepted Submission(s): 9984
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 <cstdio>#include <iostream>using namespace std;const int maxn = 1000 + 10;int pre[maxn];int find(int x){ while (x != pre[x]) x = pre[x]; return x;}void mix(int x, int y){ int fx = find(x); int fy = find(y); if (fx != fy) pre[fy] = fx;}int main(){ int t, n, m; int a, b; int ans; scanf("%d", &t); while (t--){ scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) pre[i] = i; for (int i = 1; i <= m; i++){ scanf("%d%d", &a, &b); mix(a, b); } ans = 0; for (int i = 1; i <= n; i++){ if (pre[i] == i) ans++; } printf("%d\n", ans); } return 0;}
0 0
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj-1213-How Many Tables
- HDOJ-1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDOJ-1213-How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDOJ How Many Tables
- ACM HDOJ 1213 (How Many Tables )
- HDOJ-1213 How Many Tables(包含题意)
- HDOJ 1856 More is better
- wpa_cli
- Stream、Reader说明;Stream与String互转
- Hive内置数据类型
- volatile
- HDOJ 1213 How Many Tables
- 最近5年133个Java面试问题列表
- SQL Server 存储过程
- 构建Unity3D信号槽机制 【ZObject.cs】
- Mac OS X 10.10 启用 Web 服务器
- HDOJ 2545 树上战争
- Python面向对象
- js数组引用传递
- 砍树问题