3762457_ac_469ms_624k.cc

北大大牛代码 1240道题的原代码 超级权威

#include<iostream>
using namespace std;

	const int Size = 1000 + 5;
	int flag[Size], n, m;
	class node
	{
	public:
		int x, y, val;
		char str[10];
	}ans[1000000 + 5];

int main()
{
	int i, j, k, t, val;
	char str[10];

	while(scanf("%d %d", & n, & m) != EOF)
	{
		memset(flag, -1, sizeof(flag));
		for(i = 0; i < m; i ++)
			scanf("%d %d %d %s", & ans[i].x, & ans[i].y, & ans[i].val, ans[i].str);

		int ok = 0;
again:
		for(j = 0; j < n; j ++){
			if(ok == 1)break;
			for(i = 0; i < m; i ++){
				k = ans[i].x, t = ans[i].y, val = ans[i].val, str[0] = ans[i].str[0];

				if(str[0] == 'A'){
					if(val == 1){
						if(flag[k] == 0 || flag[t] == 0)
							ok = 1;
						else flag[k] = flag[t] = 1;
					}
					else if(val == 0){
						if(flag[k] == 1 && flag[t] == -1)
							flag[t] = 0;
						else if(flag[t] == 1 && flag[k] == -1)
							flag[k] = 0;
						else if(flag[k] == 1 && flag[t] == 1)
							ok = 1;
					}
				}
				else if(str[0] == 'O'){
					if(val == 0){
						if(flag[k] == -1 && flag[t] == -1)
							flag[k] = flag[t] = 0;
						else if(flag[k] == 0 && flag[t] == -1)
							flag[t] = 0;
						else if(flag[k] == -1 && flag[t] == 0)
							flag[k] = 0;
						else if(flag[k] == 1 || flag[t] == 1)
							ok = 1;
					}
					else if(val == 1){
						if(flag[k] == 0 && flag[t] == -1)
							flag[t] = 1;
						else if(flag[k] == -1 && flag[t] == 0)
							flag[k] = 1;
						else if(flag[k] == 0 && flag[t] == 0)
							ok = 1;
					}
				}
				else if(str[0] == 'X'){
					if(val == 0){
						if(flag[k] != -1 && flag[t] == -1)
							flag[t] = flag[k];
						else if(flag[k] == -1 && flag[t] != -1)
							flag[k] = flag[t];
						else if(flag[k] != -1 && flag[t] != -1 && flag[k] != flag[t])
							ok = 1;
					}
					else if(val == 1){
						if(flag[k] != -1 && flag[t] != -1){
							if(flag[k] == flag[t])ok = 1;
						}
						else if(flag[k] != -1 && flag[t] == -1)
							flag[t] = 1 - flag[k];
						else if(flag[k] == -1 && flag[t] != -1)
							flag[k] = 1 - flag[t];
					}

				}
			}
		}
		if(ok == 1){
			printf("NO\n");
			continue;
		}
		for(i = 0; i < n; i ++){
			if(flag[i] == -1){ 
				flag[i] = 0;
				goto again;
				if(ok == 1){
					ok = 0;
					flag[i] = 1;
					goto again;
				}
				if(ok == 1) break;
			}
		}
		if(ok == 1)
			printf("NO\n");
		else printf("YES\n");
	}
	return 0;
}