HDOJ 1213 How Many Tables(基础并查集)
来源:互联网 发布:山特维克刀具数据 编辑:程序博客网 时间:2024/05/18 20:11
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17998 Accepted Submission(s): 8856
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和畅通工程差不多,就是求分成了几部分ac代码:
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int pri[100005];int num[100005];int find(int x){int r=x;while(r!=pri[r]){r=pri[r];}int i=x,j;while(i!=r){j=pri[i];pri[i]=r;i=j;}return r;}void connect(int xx,int yy){int a=find(xx);int b=find(yy);if(a!=b)pri[b]=a;}int main(){int t;int n,m,i,f,d;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);for(i=1;i<=n;i++)pri[i]=i;for(i=0;i<m;i++){scanf("%d%d",&f,&d);connect(f,d);}memset(num,0,sizeof(num));for(i=1;i<=n;i++)num[find(i)]=1;int sum=0;for(i=1;i<=n;i++)if(num[i])sum++;printf("%d\n",sum);}return 0;}
0 0
- 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 1232 畅通工程(并查集基础,水)
- hdoj How Many Tables【并查集】
- ACM_HDU 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【并查集】
- 【hdu 1213 基础并查集】How Many Tables
- 社説 20150727 山岳遭難事故 体力や技術と相談して登ろう
- LeetCode-Delete Node in a Linked List
- 说说PendingIntent的内部机制
- 逻辑斯谛(logistic regression)回归
- TestNG 入门教程
- HDOJ 1213 How Many Tables(基础并查集)
- 社説 20150727 仕事と介護 離職防止へ支援を拡充したい
- java多线程-专题-聊聊并发(八)——Fork/Join框架介绍
- sqlite3用法详解
- 【计蒜客系列】挑战难题24:函数规律
- 7种形式的Android Dialog使用举例
- 分治法或拓扑排序 poj1463 Strategic game
- XHTML详解
- 树莓派遥控船项目计划