How Many Tables
来源:互联网 发布:淘宝小号淘气值查看 编辑:程序博客网 时间:2024/05/29 10:51
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16666 Accepted Submission(s): 8167
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
半个小时写完,2个小时查错,傻逼地将数组开小了。这道题真醉了。
#include <iostream>#include<cstdio>#include<cstring>using namespace std;int pre[1000+5];int v[1000+5];struct point{ int x,y;};point p[1000+5];int m,n;int find(int x){ int r=x; while(r!=pre[r]) r=pre[r]; int i=x,j; while(pre[i]!=r) { j=pre[i]; pre[i]=r; j=i; } return r;}void join(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { pre[fx]=fy; //return 1; } //return 0;}int main(){ int t,num=0; scanf("%d",&t); while(t--) { // if(num) printf("\n"); //num++; scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) scanf("%d%d",&p[i].x,&p[i].y); for(int i=1;i<=n;i++) pre[i]=i; int countn=0; for(int i=1;i<=m;i++) join(p[i].x,p[i].y); memset(v,0,sizeof(v)); // for(int i=1;i<=n;i++) // cout<<pre[i]<<" "; for(int i=1;i<=n;i++) { int j=i; while(pre[j]!=j) { j=pre[j]; } v[j]=1; } for(int i=1;i<=n;i++) if(v[i]) countn++; printf("%d\n",countn); } return 0;}
0 0
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- hdu1213-How Many Tables
- hdu1213 How Many Tables
- HDU How Many Tables
- hdu_1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables
- HDU How Many Tables
- HDU1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables 1213
- NSSet和NSArray转化
- NS3实例分析(1)-- hello-simulator.cc
- 返回值的运用
- MVVM Tutorial with ReactiveCocoa: Part 1/2
- Nodejs express操作cookie和session
- How Many Tables
- C语言各种数据类型取值范围
- 浏览器到底支持到javascript哪个版本
- C Primer Plus 第六章程序清单——2015.4.22
- GitHub学习笔记
- 2014-mit-jos
- poj 2425 A Chess Game grundy值
- Java学习笔记之程序内存分配问题
- android开发若干问题