【POJ2912】【加权并查集】【食物链变形】【只有一个就是只有他能nobug】

Rochambeau Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 2280   Accepted: 813 Description N children are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three groups (it is possible that some group is empty). You don’t know who is the judge, or how the children are grouped. Then the children start playing Rochambeau game for M rounds. Each round two children are arbitrarily selected to play Rochambeau for one once, and you will be told the outcome while not knowing which gesture the children presented. It is known that the children in the same group would present the same gesture (hence, two children in the same group always get draw when playing) and different groups for different gestures. The judge would present gesture randomly each time, hence no one knows what gesture the judge would present. Can you guess who is the judge after after the game ends? If you can, after how many rounds can you find out the judge at the earliest? Input Input contains multiple test cases. Each test case starts with two integers N and M (1 ≤ N ≤ 500, 0 ≤ M ≤ 2,000) in one line, which are the number of children and the number of rounds. Following are M lines, each line contains two integers in [0, N) separated by one symbol. The two integers are the IDs of the two children selected to play Rochambeau for this round. The symbol may be “=”, “>” or “<”, referring to a draw, that first child wins and that second child wins respectively. Output There is only one line for each test case. If the judge can be found, print the ID of the judge, and the least number of rounds after which the judge can be uniquely determined. If the judge can not be found, or the outcomes of the M rounds of game are inconsistent, print the corresponding message. Sample Input 3 3 0<1 1<2 2<0 3 5 0<1 0>1 1<2 1>2 0<2 4 4 0<1 0>1 2<3 2>3 1 0 Sample Output Can not determine Player 1 can be determined to be the judge after 4 lines Impossible Player 0 can be determined to be the judge after 0 lines Source Baidu Star 2006 Preliminary  Chen, Shixi (xreborner) living in http://fairyair.yeah.net/

[Submit]   [Go Back]   [Status]   [Discuss]

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
    
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define mp push_back

int n,m;
char ch;
struct Rnode
{
	int x,y,op;
}node[2010];

int F[510];
int val[510];
int Find(int x)
{
	if(F[x] == -1) return x;
	int t = Find(F[x]);
	val[x] = (val[x] + val[F[x]]) % 3;
	return F[x] = t;
}

void merge(int x,int y,int v)
{
	int fx = Find(x);
	int fy = Find(y);
	F[fy] = fx;
	val[fy] = (3-val[y] + val[x] + v) % 3;
}
int main()
{
    while(scanf("%d%d",&n,&m) != EOF)
	{
		if(n == 1)
		{
			printf("Player 0 can be determined to be the judge after 0 lines\n");
			continue;
		}	
		for(int i=0;i<m;i++)
		{
			int u,v;
			scanf("%d%c%d",&node[i].x,&ch,&node[i].y);
			if(ch == '=') node[i].op = 0;
			else if(ch == '<') node[i].op = 2;
			else node[i].op = 1;
		}
		int nobugs = 0;
		int time;
		int id;
		int maxn = 1;
		for(int i=0;i<n;i++)
		{
			if(nobugs >= 2) break;
			memset(F,-1,sizeof(F));
			memset(val,0,sizeof(val));
			bool ok = true;
			for(int j=0;j<m;j++)
			{
				Rnode cur = node[j];
				if(cur.x == i || cur.y == i) continue;
				if(Find(cur.x) == Find(cur.y))
				{
					int x = cur.x;
					int y = cur.y;
					if((val[x] + cur.op) % 3 == val[y]) 
					{

					}
					else
					{
					   ok = false;
					   maxn = max(maxn,j+1);
					   break;
					}

				}
				else
				{
					merge(cur.x,cur.y,cur.op);
				}
			}
			if(ok) 
			{
				nobugs ++;
				id = i;
			}
		}
		if(nobugs >= 2)
		{
			printf("Can not determine\n");
		}
		else if(nobugs == 1)
		{
			printf("Player %d can be determined to be the judge after %d lines\n",id,maxn);
		}
		else
		{
			printf("Impossible\n");
		}

	}
    return 0;
}