Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 35131 | Accepted: 11526 |
Description
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.
Input
Output
Sample Input
2 3 3 1 2 2 3 1 3 4 2 1 2 3 4
Sample Output
Scenario #1: Suspicious bugs found! Scenario #2: No suspicious bugs found!
这个题题意就是:
例题一
有3个人,三个"情侣",让你观察有没有同性恋的虫子
和poj1703题一样,那里是两个集团,这里只两个性别,
代码如下:
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int b[3006], a[3006];
int find(int x)
{
if ( b[x] == x )
return x;
int temp = b[x];
b[x] = find(b[x]);
a[x] = a[x]^a[temp];
return b[x];
}
bool meget( int x, int y )
{
int fx = find(x);
int fy = find(y);
if ( fx == fy )
{
if ( a[x] == a[y] )
return true;
return false;
}
b[fx] = fy;
a[fx] = !(a[x]^a[y]);
return false;
}
int main()
{
int n, m, i, j;
int T, x, y;
scanf ( "%d", &T );
for ( j = 1;j <= T; j++ )
{
int temp = 0;
scanf ( "%d %d", &n, &m );
for ( i = 1;i <= n; i++ )
{
b[i] = i;
a[i] = 0;
}
for ( i = 0;i < m; i++ )
{
scanf ( "%d %d", &x, &y );
if ( meget(x, y) )
temp = 1;
}
printf ( "Scenario #%d:\n", j );
if ( temp )
printf ( "Suspicious bugs found!\n\n" );
else
printf ( "No suspicious bugs found!\n\n" );
}
}
如有帮助记得支持我一下,谢谢!!!