链接:http://hdu.hustoj.com/showproblem.php?pid=1213
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25399 Accepted Submission(s): 12675
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
2 5 3 1 2 2 3 4 5 5 1 2 5
Sample Output
2 4
思路:一开始想到了并查集,但是觉得prim也可以做,认识的人距离为0,不认识的人距离为1然而并不行,wa了两次,也不知道为什么样例过了= =
还是老老实实并查集找根的个数吧
代码:
#define _CRT_SBCURE_MO_DEPRECATE
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<algorithm>
#include<string>
#include<string.h>
#include<set>
#include<queue>
#include<stack>
#include<functional>
using namespace std;
const int maxn = 1000 + 10;
const int INF = 1e9;
int n, m, t;
int father[maxn];
void makeSet() {
for (int i = 0; i < maxn; i++)
father[i] = i;
}
int find(int x) {
if (father[x] == x)return x;
return father[x] = find(father[x]);
}
void Union(int x, int y) {
int a, b;
a = find(x);
b = find(y);
if (a != y) father[a] = b;
}
int main()
{
while (scanf("%d", &t) != EOF) {
while (t--) {
scanf("%d %d", &n, &m);
makeSet();
int a, b;
while (m--) {
scanf("%d %d", &a, &b);
Union(a, b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (father[i] == i)ans++;
}
printf("%d\n", ans);
}
}
system("pause");
return 0;
}