SDOI2016 硬币游戏（博弈论）

题目链接

题目大意

emmm大意不好描述，看原题吧。

题解

裸SG函数，这种硬币游戏的SG值就是枚举每个可以翻的硬币，计算只存在当前硬币可以翻的SG，然后异或起来。
于是这道题就做完了，复杂度$O(n)$。

#include <bits/stdc++.h>
using namespace std;
const int MAXR = 10000000;
char _READ_[MAXR], _PRINT_[MAXR];
int _READ_POS_, _PRINT_POS_, _READ_LEN_;
inline char readc() {
#ifndef ONLINE_JUDGE
	return getchar();
#endif
	if (!_READ_POS_) _READ_LEN_ = fread(_READ_, 1, MAXR, stdin);
	char c = _READ_[_READ_POS_++];
	if (_READ_POS_ == MAXR) _READ_POS_ = 0;
	if (_READ_POS_ > _READ_LEN_) return 0;
	return c;
}
template<typename T> inline void read(T &x) {
	x = 0; register int flag = 1, c;
	while (((c = readc()) < '0' || c > '9') && c != '-');
	if (c == '-') flag = -1; else x = c - '0';
	while ((c = readc()) >= '0' && c <= '9') x = x * 10 + c - '0';
	x *= flag;
}
template<typename T1, typename ...T2> inline void read(T1 &a, T2&... x) {
	read(a), read(x...);
}
inline int reads(char *s) {
	register int len = 0, c;
	while (isspace(c = readc()) || !c);
	s[len++] = c;
	while (!isspace(c = readc()) && c) s[len++] = c;
	s[len] = 0;
	return len;
}
inline void ioflush() { fwrite(_PRINT_, 1, _PRINT_POS_, stdout), _PRINT_POS_ = 0; fflush(stdout); }
inline void printc(char c) {
	_PRINT_[_PRINT_POS_++] = c;
	if (_PRINT_POS_ == MAXR) ioflush();
}
inline void prints(char *s) {
	for (int i = 0; s[i]; i++) printc(s[i]);
}
template<typename T> inline void print(T x, char c = '\n') {
	if (x < 0) printc('-'), x = -x;
	if (x) {
		static char sta[20];
		register int tp = 0;
		for (; x; x /= 10) sta[tp++] = x % 10 + '0';
		while (tp > 0) printc(sta[--tp]);
	} else printc('0');
	printc(c);
}
template<typename T1, typename ...T2> inline void print(T1 x, T2... y) {
	print(x, ' '), print(y...);
}
typedef long long ll;

const int MAXN = 30005;
int T, n, Q, arr[MAXN], sg[20][20], lg2[MAXN], lg3[MAXN];
int mex(int k) {
	for (int i = 0;; i++) if (~k >> i & 1) return i;
}
int main() {
	for (int i = 1; i <= 30000; i++) {
		if (i % 2 == 0) lg2[i] = lg2[i / 2] + 1;
		if (i % 3 == 0) lg3[i] = lg3[i / 3] + 1;
	}
	for (read(T); T--;) {
		read(n, Q);
		int res = 0;
		for (int i = 1; i <= n; i++) read(arr[i]);
		for (int a = 1, j = 0; a <= n; a *= 2, ++j)
		for (int b = 1, k = 0; a * b <= n; b *= 3, ++k) {
			int s = 0;
			for (int p = 1; p <= j; p++) {
				int t = 0;
				for (int q = 1; p * q <= j && q <= Q; q++)
					t ^= sg[j - p * q][k], s |= 1 << t;
			}
			for (int p = 1; p <= k; p++) {
				int t = 0;
				for (int q = 1; p * q <= k && q <= Q; q++)
					t ^= sg[j][k - p * q], s |= 1 << t;
			}
			sg[j][k] = mex(s);
		}
		for (int i = 1; i <= n; i++)
			if (!arr[i]) res ^= sg[lg2[i]][lg3[i]];
		puts(res ? "win" : "lose");
	}
	return 0;
}