poj4049

//============================================================================
// Name        : 4049.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <stdio.h>
using namespace std;
#define N 4

typedef enum result {
	WIN, TIE, LOSE, UNKNOWN
} Result;

int x[N][N];
Result want;
int empty;
int xxx;

void outX() {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			printf("%d", x[i][j]);
		}
		puts("");
	}
	puts("");
}

Result getResult() {
	int sum1 = 0;
	int sum2 = 0;
	for (int i = 0; i < N; i++) {
		sum1 += x[i][i];
		sum2 += x[i][N - 1 - i];

		int sum3 = 0;
		int sum4 = 0;
		for (int j = 0; j < N; j++) {
			sum3 += x[i][j];
			sum4 += x[j][i];
		}
		if ((sum3 & 4) || (sum4 & 4)) {
			if (xxx)
				return WIN;
			else
				return LOSE;
		}
		if ((sum3 & 32) || (sum4 & 32)) {
			if (xxx)
				return LOSE;
			else
				return WIN;
		}
	}
	if ((sum1 & 4) || (sum2 & 4)) {
		if (xxx)
			return WIN;
		else
			return LOSE;
	}
	if ((sum1 & 32) || (sum2 & 32)) {
		if (xxx)
			return LOSE;
		else
			return WIN;
	}
	if (empty == 0) {
		return TIE;
	} else {
		return UNKNOWN;
	}
}

bool succeed(bool self) {
	if (self) {
		for (int i = 0; i < N; i++)
			for (int j = 0; j < N; j++) {
				if (x[i][j] == 0) {
					if (xxx)
						x[i][j] = 1;
					else
						x[i][j] = 8;
					empty--;
					Result rs = getResult();
					if (rs == want) {
						x[i][j] = 0;
						empty++;
						return true;
					} else if (rs == UNKNOWN) {
						if (succeed(false)) {
							x[i][j] = 0;
							empty++;
							return true;
						} else {
							x[i][j] = 0;
							empty++;
						}
					} else {
						x[i][j] = 0;
						empty++;
					}
				}
			}
		return false;
	} else {
		for (int i = 0; i < N; i++)
			for (int j = 0; j < N; j++) {
				if (x[i][j] == 0) {
					if (xxx)
						x[i][j] = 8;
					else
						x[i][j]=1;
					empty--;
					Result rs = getResult();
					if (rs == UNKNOWN) {
						if (!succeed(true)) {
							x[i][j] = 0;
							empty++;
							return false;
						} else {
							x[i][j] = 0;
							empty++;
						}
					} else if (rs != want) {
						x[i][j] = 0;
						empty++;
						return false;
					} else {
						x[i][j] = 0;
						empty++;
					}
				}
			}
		return true;
	}
}

int main() {
	int t;
	scanf("%d", &t);
	char str[5];
	while (t--) {
		scanf("%s", str);
		switch (str[0]) {
		case 'L':
			want = LOSE;
			break;
		case 'W':
			want = WIN;
			break;
		case 'T':
			want = TIE;
			break;
		}
		empty = 0;
		xxx = 1;
		for (int i = 0; i < N; i++) {
			scanf("%s", str);
			for (int j = 0; j < N; j++) {
				switch (str[j]) {
				case '.':
					x[i][j] = 0;
					empty++;
					break;
				case 'x':
					x[i][j] = 1;
					xxx--;
					break;
				case 'o':
					x[i][j] = 8;
					xxx++;
					break;
				}
			}
		}
		bool su = succeed(true);
		if (su)
			puts("YES");
		else
			puts("NO");
	}
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值