提出 #34800197

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

int main()
{
	ios::sync_with_stdio(0);
	int n, M;
	cin >> n >> M;
	n <<= 1;
	map <int, bool> A;
	while (n --) {
		int x;
		cin >> x;
		A[x] ^= 1;
	}
	int N = 0, s = 0;
	map <int, int> nA;
	for (auto pr : A) {
		if (pr.second) {
			N ++;
			s = (s + pr.first) % M;
			nA[(pr.first * 2) % M] ++;
		}
	}
	vector <int> vA;
	for (auto pr : nA) {
		for (int i = 0; i < pr.second; ++ i) {
			vA.push_back(pr.first);
		}
	}
	if (N % 2 == 0) {
		bool ok = 1;
		int ss = 0;
		for (int i = 0; i < (int) vA.size(); ++ i) {
			ok &= vA[i] == vA[i ^ 1];
			if (i % 2 == 0) ss = (ss + vA[i]) % M;
		}
		if (ss != s) ok = 0;
		if (ok) {
			puts("Bob");
			return 0;
		}
	}
	if (N >= 5) {
		puts("Alice");
		return 0;
	}
	function <bool(int, int, int)> Solve = [&] (int mask, int turn, int target) -> bool
	{
		int c = __builtin_popcount(mask);
		if (c == 1) {
			if (turn == 0) return vA[__builtin_ctz(mask)] != target;
			else return 0 == target;
		}
		for (int i = 0; i < (int) vA.size(); ++ i) if (mask >> i & 1) {
			int ntarget = (target + (turn == 0 ? M - vA[i] : 0)) % M;
			if (!Solve(mask ^ 1 << i, turn ^ 1, ntarget)) return 1;
		}
		return 0;
	};
	puts(Solve((1 << (int) vA.size()) - 1, 0, s) ? "Alice" : "Bob");
	return 0;
}

提出情報

ジャッジ結果