九度OJ-1445:How Many Tables
来源:互联网 发布:淘宝返现也不评价 编辑:程序博客网 时间:2024/06/08 12:14
用并查集求连通分量数。与上题完全一样,不赘述。
- 题目描述:
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.
- 输入:
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.
- 输出:
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
- 样例输入:
25 31 22 34 55 12 5
- 样例输出:
24
#include <iostream> #define MAXSIZE 1000using namespace std;struct UFS{//UnionFindSet ´Ó0¿ªÊ¼ int elem[MAXSIZE];int size;void initiate(int size){this->size=size;for (int i=0;i<size;i++)elem[i]=-1;}int findRoot(int x){//reduce deep if (elem[x]==-1) return x;else return elem[x]=findRoot(elem[x]);}void unionSet(int x,int y){int xroot=findRoot(x),yroot=findRoot(y);if (xroot!=yroot)//if x and y are from different set elem[xroot]=yroot; //merge xset into yset }};int main(){int t,n,m;int a,b;int count;UFS ufs;cin>>t;for (int time=0;time<t;time++){cin>>n>>m;//initiateufs.initiate(n);count=0;//input&&unionfor (int i=0;i<m;i++){cin>>a>>b;a-=1;b-=1;ufs.unionSet(a,b);}//countfor (int i=0;i<ufs.size;i++){if (ufs.elem[i]==-1)count++;} cout<<count<<endl;}return true;}
- 九度OJ-1445:How Many Tables
- 九度oj 题目1445:How Many Tables
- 【九度OJ】题目1445:How Many Tables 解题报告
- 题目1445:How Many Tables 九度OJ
- 【九度】题目1445:How Many Tables
- 九度 题目1445:How Many Tables
- 九度 题目1445:How Many Tables
- 杭电oj--1213 How Many Tables
- 题目1445:How Many Tables
- 题目1445:How Many Tables
- 题目1445:How Many Tables
- Hdu oj 1213 How Many Tables(并查集)
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- HTTP Status 404 - There is no Action mapped for namespace [/] and action name [] associated with con
- 主成分分析-PCA
- Leetcode 97 - Interleaving String(dp)
- 运算电路基础
- 虚拟机ping不通主机,但是主机可以ping通虚拟机 ——linux笔记(1)
- 九度OJ-1445:How Many Tables
- Codeforces Round #321 (Div. 2)E 线段树+字符串hash
- 初学Android:广播机制学习小结
- CLH锁的实现
- 软中断/tasklet/工作队列 区别
- 振兴中华
- node.js包管理器和代码调试
- http://blog.jiguang.cn/couchbase_distributed_storage/
- node.js全局对象和全局变量