HDU--1213 -- How Many Tables [水水的并查集]
来源:互联网 发布:sql导入access 编辑:程序博客网 时间:2024/05/29 04:15
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9284 Accepted Submission(s): 4568
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
Code:
和1232几乎一样啊有木有,只改了个数啊
#include"stdio.h"int set[1001];int search(int n){while(set[n]!=n)n = set[n];return set[n];} void update(int a,int b){if(search(a)!=search(b))set[search(a)] = search(b);}int main(){int a,b,m,n,count;int t,i;scanf("%d",&t);while(t--){count=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i++)set[i] = i;while(m--){scanf("%d%d",&a,&b);update(a,b);}for(i=1;i<=n;i++)if(set[i]==i) count++;printf("%d\n",count);}return 0;}
- HDU 1213 How Many Tables 并查集 水~
- HDU- -1213 How Many Tables(水+并查集)
- hdu 1213 How Many Tables(简单的并查集)
- HDU--1213 -- How Many Tables [水水的并查集]
- 并查集 hdu How Many Tables
- hdu 1213 How Many Tables(并查集~~)
- Hdu 1213How 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 并查集入门
- HDU 1213 How Many Tables(并查集)
- [ACM] hdu 1213 How Many Tables(并查集)
- [ACM] hdu 1213 How Many Tables(并查集)
- 【并查集】 HDU 1213 How Many Tables
- hdu 1213 How Many Tables(并查集学习)
- 信号量、互斥体和自旋锁
- C++中的容器类详解 ----写得很详细
- Linux curl使用简单介绍
- 我编了一个0.1盖茨的程序
- NET单例模式几种写法
- HDU--1213 -- How Many Tables [水水的并查集]
- Apache POI如何获取Excel合并单元格的值
- How to "Build" a Computer
- Qt界面编程:窗口传值方式
- ajax 请求后台
- USACO 2.4.3 Cow Tours
- win7 程序(右下角)小图标应该如何设置【乡巴佬】
- 按位异或运算
- 斐波那契数列 C++算法