hdoj 1213 How Many Tables 【并查集】
来源:互联网 发布:怎么发送淘宝店铺链接 编辑:程序博客网 时间:2024/05/18 17:59
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18124 Accepted Submission(s): 8927
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<stdlib.h>#include<algorithm>#include<queue>using namespace std;int per[1100];int n,m;int init(){ for(int i=1;i<=n;i++) { per[i]=i; }}int find(int x){ int r; r=x; while(r!=per[r]) { r=per[r]; } per[x]=r; return r;}int join(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) per[fx]=fy;}int main(){ int a,b,t,i; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); init(); for(i=1;i<=m;i++) { scanf("%d%d",&a,&b); join(a,b); } int ans=0; for(i=1;i<=n;i++) { if(i==per[i]) { ans++; } } printf("%d\n",ans); } return 0;}
0 0
- hdoj 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 1213 How Many Tables (并查集||最小生成树)
- HDOJ How Many Tables 1213(入门级并查集)
- 并查集——HDOJ 1213How Many Tables解题报告
- Ionic入门
- SQL查询语句(一)
- How do I sort an array of hashes by a value in the hash?
- JXLS-----JXLS读取Excel实例
- 第一周周三
- hdoj 1213 How Many Tables 【并查集】
- 机房收费系统——再回首
- 查找文件中的某个内容出现的次数
- GCD理解(二)
- hdu杭电2120 Ice_cream's world I【并查集】
- Linux基本命令
- Swift中元组(Tuples),结构体(Struct),枚举(Enums)之间的区别
- Android动态改变GridView的值【安卓进化二十二】
- solr+solrJ facet.pivot 用法实例