HDU 1213 How Many Tables
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27651 Accepted Submission(s): 13726
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.
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
2
5 3
1 2
2 3
4 5
5 1
2 5
Sample Output
2
4
Author
Ignatius.L
Source
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1213
分析:又是一波并查集,终于给我搞定了一道题,受了畅通工程的影响,这道题我也是刷刷刷的就过了!高兴!
具体并查集该怎么写,可以参照我的博客有关并查集专题讲解,绝对让你受益一生!
下面给出AC代码:
1 #include <bits/stdc++.h>
2 using namespace std;
3 int pre[1010];
4 int t[1010];
5 int find(int x)
6 {
7 int r=x;
8 while(pre[r]!=r)
9 r=pre[r];
10 int i=x,j;
11 while(pre[r]!=r)
12 {
13 j=pre[r];
14 pre[r]=r;
15 i=j;
16 }
17 return r;
18 }
19 void join(int x,int y)
20 {
21 int fx=find(x),fy=find(y);
22 if(fx!=fy)
23 pre[fy]=fx;
24 }
25 int main()
26 {
27 int N,M,a,b,i,ans,n,m;
28 while(scanf("%d",&N)!=EOF)
29 {
30 while(N--)
31 {
32 scanf("%d%d",&a,&b);
33 for(i=1;i<=a;i++)
34 pre[i]=i;
35 for(i=1;i<=b;i++)
36 {
37 scanf("%d%d",&n,&m);
38 join(n,m);
39 }
40 memset(t,0,sizeof(t));
41 for(i=1;i<=a;i++)
42 t[find(i)]=1;
43 for(ans=0,i=1;i<=a;i++)
44 if(t[i])
45 ans++;
46 printf("%dn",ans);
47 }
48 }
49 return 0;
50 }
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法