（SG博弈）uva 10561 - Treblecross

最新推荐文章于 2019-08-19 20:10:00 发布

better_life30

最新推荐文章于 2019-08-19 20:10:00 发布

阅读量385

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈

本文链接：https://blog.youkuaiyun.com/better_life30/article/details/47667785

博弈专栏收录该内容

9 篇文章

订阅专栏

本文探讨了人工智能算法在游戏开发领域的应用，包括AI音视频处理、图像处理AR特效等，展示了如何将AI技术融入游戏，提升用户体验。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=477&problem=1502&mosmsg=Submission+received+with+ID+15934726

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define mem(x,i)	memset(x,i,sizeof(x))
#define sf1(a)		scanf("%d", &a)  
#define sf2(a,b)	scanf("%d %d", &a, &b)  
#define sf3(a,b,c)	scanf("%d %d %d", &a, &b, &c)  
#define sf			scanf
#define pf			printf 
const double EPS = 1e-10;
const double pai = acos(-1.0);
const int INF = 0xfffffff;
const int MOD = 1000000007;
typedef long long LL;
const int maxn = 205;

int g[maxn];
char a[maxn];
int mex(set<int> &s){
	set<int>::iterator it = s.begin();
	for (int i = 0; it != s.end(); it++, i++)
	if (*it != i)
		return i;
	return s.size();
}
void GetSG(){
	g[0] = 0; g[1] = g[2] = g[3] = 1;
	for (int x = 4; x < maxn; x++){
		set<int> s;
		for (int j = 3; x - j >= 0; j++){
			if (j <= 5)
				s.insert(g[x - j]);
			else if (j > 5)
				s.insert(g[j - 5] ^ g[x - j]);
		}
		g[x] = mex(s);
	}
}
bool judge(char *a){
	int len = strlen(a);
	for (int i = 0; i < len; i++){
		if (i + 2 < len&&a[i] == 'X'&&a[i + 1] == 'X'&&a[i + 2] == 'X')
			return false;
	}
	for (int i = 0; i < len; i++){
		if ((i + 1 < len&&a[i] == 'X'&&a[i + 1] == 'X') || (i + 2 < len&&a[i] == 'X'&&a[i + 2] == 'X'))
			return true;
	}

	char b[maxn];
	strcpy(b, a);
	for (int i = 0; i < len; i++){
		if (a[i] == 'X'){
			if (0 <= i - 1 && i - 1 < len)	b[i - 1] = 'X';
			if (0 <= i - 2 && i - 2 < len)	b[i - 2] = 'X';
			if (0 <= i + 1 && i + 1 < len)	b[i + 1] = 'X';
			if (0 <= i + 2 && i + 2 < len)	b[i + 2] = 'X';
		}
	}
	int cnt = 0;
	vector<int> s;
	for (int i = 0; i < len; i++){
		if (b[i] == 'X'){
			s.push_back(cnt);
			cnt = 0;
		}
		else if (b[i] == '.')
			cnt++;

		if (i == len - 1)	s.push_back(cnt);
	}
	int ret = 0;
	for (int i = 0; i < s.size(); i++)
		ret ^= g[s[i]];
	return ret != 0;
}
int main()
{
	//freopen("f:\\input1.txt", "r", stdin);
	GetSG();
	int T;
	sf1(T);
	while (T--){
		sf("%s", a);
		if (judge(a)){
			pf("WINNING\n");
			vector<int> ans;
			for (int i = 0; i < strlen(a); i++){
				if (a[i] == '.'){
					a[i] = 'X';
					if (judge(a) == false)	ans.push_back(i + 1);
					a[i] = '.';
				}
			}
			for (int i = 0; i < ans.size(); i++)
				pf("%d%s", ans[i], i == ans.size() - 1 ? "\n" : " ");
		}
		else pf("LOSING\n\n");
	}
	return 0;
}
/*
4
.....
X.....X..X.............X....X..X
.X.X...X
...............................................


WINNING
3
LOSING
WINNING
3
WINNING
1 12 15 17 20 24 28 31 33 36 47
*/