hdu 1213 How Many Tables 并查集
来源:互联网 发布:长沙编程招聘信息 编辑:程序博客网 时间:2024/06/05 07:02
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.
25 31 22 34 55 12 5
24
#include<cstdio>#include<cstring>using namespace std;int per[1010];bool use[1010];void init(int n){ for(int i=1;i<=n;i++) per[i]=i;}int find(int x){ return x==per[x]?x:find(per[x]);}void unions(int a,int b){ int x=find(a); int y=find(b); if(x==y) return ; else per[y]=x;}int main(){ int t; int n,m; int x,y; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); init(n); memset(use,false,sizeof(use)); for(int i=0;i<m;i++) { scanf("%d%d",&x,&y); unions(x,y); } int ans=0; for(int i=1;i<=n;i++) { if(use[find(i)]==false) { ans++; use[find(i)]=true; } } printf("%d\n",ans); } return 0;}
题意
输入n个人,m组朋友,若a于b是朋友,b于c值朋友,则a于c也为朋友,为朋友的人相互坐在一个桌子上。一共需要多少桌子。。
阅读全文
0 0
- 并查集 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 并查集 水~
- 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(并查集学习)
- HDU-#1213 How Many Tables (并查集)
- HDU - 1213 How Many Tables (简单并查集)
- HDU 1213 How Many Tables(并查集)
- AWSS3技术点分析
- A
- LeetCode -- 88. Merge Sorted Array
- bzoj1943: [Ceoi2007]Nasty Calculations
- HDU
- hdu 1213 How Many Tables 并查集
- 安装react并创建一个demo
- 进行docker 安装并搭建tensorflow 框架用于以后tensorflow 测试学习
- Struts2学习笔记一
- string详解
- HDU-1203-I NEED A OFFER!(01背包)
- EC2 使用秘钥登录
- java常用数据结构的比较
- linux版本,Centos、Redhat、Ubuntu区别(预习)