How Many Tables (简单并查集)
来源:互联网 发布:炉石传说有mac版吗 编辑:程序博客网 时间:2024/06/07 19:25
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32330 Accepted Submission(s): 16122
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
Author
Ignatius.L
Source
杭电ACM省赛集训队选拔赛之热身赛
题意:比如A B 也就A认识B,B C 就是B 认识C ,此时ABC都认识,则为一组,问最后能有几组;
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=1010;
int par[N];
void init(int n)//初始化一个编号为一组
{
for(int i=0;i<=n;i++)
{
par[i]=i;
}
}
int find(int x)//找个这组的第一个
{
if(par[x]==x) return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)//将x,y合为一组
{
x=find(x);y=find(y);
par[y]=x;
}
bool same(int x,int y)
{
return find(x)==find(y);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d %d" ,&n, &m);
init(n);
int i,a,b;
for(i=0;i<m;i++)
{
scanf("%d%d", &a,&b);
if(!same(a,b))
{
unite(a,b);
}
}
int d=0;
for(i=1;i<=n;i++)
{
if(par[i]==i) d++;
}
printf("%d\n",d);
}
return 0;
}
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=1010;
int par[N];
void init(int n)//初始化一个编号为一组
{
for(int i=0;i<=n;i++)
{
par[i]=i;
}
}
int find(int x)//找个这组的第一个
{
if(par[x]==x) return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)//将x,y合为一组
{
x=find(x);y=find(y);
par[y]=x;
}
bool same(int x,int y)
{
return find(x)==find(y);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d %d" ,&n, &m);
init(n);
int i,a,b;
for(i=0;i<m;i++)
{
scanf("%d%d", &a,&b);
if(!same(a,b))
{
unite(a,b);
}
}
int d=0;
for(i=1;i<=n;i++)
{
if(par[i]==i) d++;
}
printf("%d\n",d);
}
return 0;
}
人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想。
阅读全文
0 0
- How many tables?(简单并查集)
- HDU1213 How Many Tables(简单的并查集)
- HDU - 1213 How Many Tables (简单并查集)
- HDU:1213 How Many Tables(简单并查集)
- HDU 1213 How Many Tables(简单并查集)
- How Many Tables (简单并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- Hud 1213 How Many Tables[简单并查集]
- hdu 1213 How Many Tables(UFS 简单并查集)
- HDU 1213 How Many Tables(并查集,简单)
- HDU 1213 How Many Tables? (简单并查集)
- hdu 1213 How Many Tables(简单的并查集)
- HDU 1213 How Many Tables【简单并查集】
- 并查集:HDU1213-How Many Tables(并查集最简单的应用)
- 【hdu1213】How Many Tables【并查集】
- How Many Tables(并查集)
- 《网络经济与企业管理》第一遍思维导图
- 设计模式——单例
- 二叉树的路径和
- 背包问题 (Knapsack.cpp)
- C++实现身份证校验和归属地查询
- How Many Tables (简单并查集)
- 双线性插值
- 知乎9.6万高赞回答:如何长时间高效学习?
- 集合框架——定义泛型方法
- 属性动画
- 别把&和nohup混为一谈, 根本不是同一个东西好不好 ------ 聊聊./a.out & , nohut ./a.out , nohup ./a.out &的区别
- java 开源项目(大汇总)
- SQL VIEW(视图)介绍
- allocator