概述:有一个物种的一些个体,给出一些数对x,y,表示x和y不是一种性别,然后给出许多数对,问有没有矛盾。
思路:分组并查集,用两个并查集,表示两种性别,然后不断的合并,如果有冲突,就终止,否则就一直合并,最后输出结果。
感想:很有实际意义的问题。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
const int MAX = 3005;
bool flag;
int fa, fb, n;
int father[MAX], relation[MAX];
int find(int x)
{
if (father[x] == -1)
return x;
else
{
int tmp = father[x];
father[x] = find(father[x]);
relation[x] = (relation[x] + relation[tmp]) % 2;
return father[x];
}
}
void merge(int fa, int fb)
{
father[fa] = fb;
relation[fa] = (relation[a] + relation[b] + 1) % 2;
}
int main()
{
int T, m, a, b;
scanf("%d", &T);
for (int k = 1; k <= T; ++k)
{
flag = true;
scanf("%d%d", &n, &m);
{
memset(father, -1, sizeof(father));
memset(relation, 0, sizeof(relation));
while (m--)
{
scanf("%d%d", &a, &b);
if (!flag)
continue;
fa = find(a);
fb = find(b);
if (fa != fb)
{
merge(fa, fb);
}
else
{
if (relation[a] == relation[b])
flag = false;
}
}
printf("Scenario #%d:\n", k);
if (flag)
printf("No suspicious bugs found!\n\n");
else
printf("Suspicious bugs found!\n\n");
}
}
return 0;
}