HDOJ 1213 how many tables (并查集)
来源:互联网 发布:A号黑豹战斗数据 编辑:程序博客网 时间:2024/05/18 18:42
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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>int per[1100];//int k;int find(int x){ int t=x; while (t!=per[t]) t=per[t]; per[x]=t; return t;}void un(int a,int b){ int xa=find(a); int xb=find(b); if (xa!=xb) per[xa]=xb; }int main(){ int n,m,t; scanf ("%d",&t); while (t--) { while (scanf ("%d%d",&n,&m)!=EOF) { for (int i=1;i<=n;i++) per[i]=i; int x,y; while (m--) { scanf ("%d%d",&x,&y); un(x,y); } int k=0; for (int i=1;i<=n;i++) { if (per[i]==i) k++; } printf ("%d\n",k); } } 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解题报告
- hdu 5414 CRB and String (贪心)
- 文件乱码的解决办法
- Java-泛型
- JDBC编程的十个最佳实践
- HDU 5328(Problem Killer-暴力)
- HDOJ 1213 how many tables (并查集)
- Hibernate缓存
- Linux定时任务crontab
- Linux文件文本的基本命令及bash的特性
- ctags
- XML类型的drawable图片的解析处理过程
- Java字符串的10大热点问题盘点
- [计算机网络学习笔记]:协议概述
- MAVEN 创建普通项目