一、内容
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
二、思路
- 利用并查集判断有多少个连通块即可。 或者dfs搜索一下多少个连通块。
三、代码
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1005;
int t, n, m, p[N], a, b;
void init() {
for (int i = 1; i <= n; i++) p[i] = i;
}
int find(int x) {
return x == p[x] ? x : (p[x] = find(p[x]));
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &m);
init();
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
int fa = find(a);
int fb = find(b);
p[fa] = fb;
}
int ans = 0; //寻找有几个连通块
for (int i = 1; i <= n; i++) {
if (p[i] == i) ans++;
}
printf("%d\n", ans);
}
return 0;
}
