hd 1213 How Many Tables
来源:互联网 发布:哪里查非农数据 编辑:程序博客网 时间:2024/06/05 12:04
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24371 Accepted Submission(s): 12197
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;int pre[1010];int find(int x){ while(x != pre[x]) x = pre[x]; return x;}void Union(int x,int y){ int fx,fy; fx = find(x); fy = find(y); if(fx != fy) pre[fx] = fy;}int main(){ int t,n,m,a,b; cin >> t; while(t--) { cin >> n >> m; for(int i = 1 ; i <= n ; i++) pre[i] = i; for(int j = 0 ; j < m ; j++) { cin >> a >> b; Union(a,b); } int ans = 0; for(int i = 1 ; i <= n ; i++) { if(pre[i] == i) ans++; } cout << ans << endl; } return 0;}
0 0
- How Many Tables hd 1213
- hd 1213 How Many Tables
- 【HD 1213】How Many Tables
- HD 1213 How Many Tables 【并查集】
- HD 1213 How Many Tables(裸 并查集)
- HD-1213-How Many Tables(并查集)
- 1408012025-hd-How Many Tables.cpp
- How Many Tables 1213
- 1213 How Many Tables
- 1213:How Many Tables
- hdu 1213 how many tables
- hdu 1213 How Many Tables
- HDOJ 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDU 1213 How Many Tables
- ssh整合问题总结--使用HibernateTemplate实现数据分页展示
- Android Studio解决未识别Java文件(出现红J)问题
- NYOJ 19 擅长排列的小明(排列 dfs /STL)
- 欢迎使用CSDN-markdown编辑器
- Bestcoder round#84 解题报告
- hd 1213 How Many Tables
- 移动游戏性能优化技术干货分享——CPU篇
- iOS 全局常量const
- Android中进程相关信息获取,pid,进程名
- 没有了梦想,跟咸鱼又有什么区别!
- jquery插件FileUpload实现异步上传文件
- Linux c 调试工具---mtrace
- linux下tftp使用(服务器和客户端)
- 上下滑动的API