結果

問題 No.2814 Block Game
ユーザー ecotteaecottea
提出日時 2024-07-20 00:38:49
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 21,312 bytes
コンパイル時間 5,257 ms
コンパイル使用メモリ 291,696 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-20 00:39:13
合計ジャッジ時間 22,849 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other WA * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = static_modint<1000000000>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
void WA() {
int t;
cin >> t;
rep(hoge, t) {
ll n; string s;
cin >> n >> s;
if (n == 1) {
cout << (s == "Odd" ? "Alice" : "Bob") << "\n";
}
else if (n == 2) {
cout << (s == "Odd" ? "Alice" : "Bob") << "\n";
}
else if (popcount(n) == 1) {
cout << (s == "Even" ? "Alice" : "Bob") << "\n";
}
else if (n % 2 == 0) {
ll m = n / 2;
cout << ((s == "Even") == (m % 2 == 0) ? "Bob" : "Alice") << "\n";
}
else {
ll m = (n - 1) / 2;
int b = ((n - 1) & m) == m;
dump(n, m, b);
cout << ((s == "Even") == (b % 2 == 0) ? "Alice" : "Bob") << "\n";
}
}
}
//F_2
/*
* BFPS<N>() : O(1)
* f = 0
* N
*
* BFPS<N>(bool c0, int n = 1) : O(1)
* n f = c0
*
* BFPS<N>(bitset c, int n) : O(n / 64)
* f(x) = c[0] + c[1] z + ... + c[n-1] z^(n-1)
*
* c + f, f + c : O(1) f + g : O(n / 64)
* f * g : O(n^2 / 64) f * g_sp : O(n |g|)
* f / g : O(n^2 / 64) f / g_sp : O(n |g|)
*
* g_sp 1 vector
* : g(0) = 1
*
* BFPS f.inv(int d) : O(n^2 / 64)
* 1 / f mod z^d
* : f(0) = 1
*
* BFPS f.quotient(BFPS g) : O(n^2 / 64)
* BFPS f.reminder(BFPS g) : O(n^2 / 64)
* pair<BFPS, BFPS> f.quotient_remainder(BFPS g) : O(n^2 / 64)
* f g
* : g 1
*
* BFPS f.quotient(SFPS g) : O((n + deg(g)) |g|)
* BFPS f.reminder(SFPS g) : O((n + deg(g)) |g|)
* pair<BFPS, BFPS> f.quotient_remainder(SFPS g) : O((n + deg(g)) |g|)
* f g
* : g 1
*
* int f.deg(), int f.size() : O(1)
* f [+1]
*
* BFPS::monomial(int d) : O(d / 64)
* z^d
*
* int popcount() : O(n / 64)
*
*
* f.resize(int d) : O(1)
* mod z^d
*
* f.resize() : O(n / 64)
*
*
* f >> d, f << d : O(n / 64)
* d []
* z^d z^d
*/
template <int N>
struct BFPS {
using SFPS = vi;
int n; // + 1
bitset<N> c; //
//
BFPS() : n(0) {}
BFPS(bool c0, int n = 1) : n(n) { c[0] = c0; }
BFPS(const bitset<N>& c, int n) : n(n), c(c) {}
//
BFPS(const BFPS& f) = default;
BFPS& operator=(const BFPS& f) = default;
BFPS& operator=(bool c0) { n = 1; c.reset(); c[0] = c0; return *this; }
//
bool operator==(const BFPS& g) const { return c == g.c; }
bool operator!=(const BFPS& g) const { return c != g.c; }
//
bool operator[](int i) const { return c[i]; }
typename bitset<N>::reference operator[](int i) { return c[i]; }
//
int deg() const { return n - 1; }
int size() const { return n; }
//
BFPS& operator+=(const BFPS& g) {
chmax(n, g.n); c ^= g.c;
return *this;
}
BFPS operator+(const BFPS& g) const { return BFPS(*this) += g; }
//
BFPS& operator+=(bool sc) {
chmax(n, 1); c[0] = c[0] ^ sc;
return *this;
}
BFPS operator+(bool sc) const { return BFPS(*this) += sc; }
friend BFPS operator+(bool sc, const BFPS& f) { return f + sc; }
//
BFPS& operator*=(const BFPS& g) {
// verify : https://atcoder.jp/contests/abc009/tasks/abc009_4
n += g.n - 1;
bitset<N> res;
rep(i, g.n) if (g[i]) res ^= c << i;
c = move(res);
return *this;
}
BFPS operator*(const BFPS& g) const { return BFPS(*this) *= g; }
//
BFPS inv(int d) const {
Assert(n >= 1 && c[0]);
BFPS res(1, d);
bitset<N> mul(c);
repi(i, 1, d - 1) {
if (mul[i]) {
res[i] = 1;
mul ^= c << i;
}
}
bitset<N> mask; mask.set(); mask >>= N - d;
res.c &= mask;
return res;
}
BFPS& operator/=(const BFPS& g) { return *this *= g.inv(n); }
BFPS operator/(const BFPS& g) const { return BFPS(*this) /= g; }
//
pair<BFPS, BFPS> quotient_remainder(const BFPS& g) const {
BFPS q, r(c, g.n - 1);
repir(i, n - 1, g.n - 1) {
if (r[i]) {
q[i - g.n + 1] = 1;
r.c ^= g.c << (i - g.n + 1);
}
}
q.n = n - r.n;
return make_pair(q, r);
}
BFPS quotient(const BFPS& g) const {
// verify : https://atcoder.jp/contests/arc084/tasks/arc084_d
return quotient_remainder(g).first;
}
BFPS reminder(const BFPS& g) const { return quotient_remainder(g).second; }
//
BFPS& operator*=(const SFPS& g) {
n += *g.rbegin();
bitset<N> res;
repe(i, g) res ^= c << i;
c = res;
return *this;
}
BFPS operator*(const SFPS& g) const { return BFPS(*this) *= g; }
//
BFPS& operator/=(const SFPS& g) {
// g
auto it0 = g.begin();
Assert(*it0 == 0);
it0++;
// DP
rep(i, n) {
//
for (auto it = it0; it != g.end(); it++) {
if (i + *it >= n) break;
c[i + *it] = c[i + *it] ^ c[i];
}
}
return *this;
}
BFPS operator/(const SFPS& g) const { return BFPS(*this) /= g; }
//
pair<BFPS, BFPS> quotient_remainder(const SFPS& g) const {
// verify : https://atcoder.jp/contests/arc147/tasks/arc147_f
BFPS q, r(c, g.back());
repir(i, n - 1, g.back()) {
if (r[i]) {
q[i - g.back()] = 1;
repe(j, g) r[i + j - g.back()] = r[i + j - g.back()] ^ 1;
}
}
q.n = n - r.n;
return make_pair(q, r);
}
BFPS quotient(const SFPS& g) const { return quotient_remainder(g).first; }
BFPS reminder(const SFPS& g) const { return quotient_remainder(g).second; }
// z^d
static BFPS monomial(int d) {
BFPS mono(0, d + 1);
mono[d] = 1;
return mono;
}
// 1
int popcount() const {
// verify : https://atcoder.jp/contests/arc156/tasks/arc156_d
return (int)c.count();
}
// 0
BFPS& resize() {
while (n > 0 && !c[n - 1]) n--;
return *this;
}
// z^d
BFPS& resize(int d) {
n = d;
bitset<N> mask; mask.set(); mask >>= N - d;
c &= mask;
return *this;
}
//
BFPS& operator>>=(int d) { n += d; c <<= d; return *this; }
BFPS& operator<<=(int d) { n = max(n - d, 0); c >>= d; return *this; }
BFPS operator>>(int d) const { return BFPS(*this) >>= d; }
BFPS operator<<(int d) const { return BFPS(*this) <<= d; }
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const BFPS& f) {
if (f.n == 0) os << 0;
else {
rep(i, f.n) {
os << f[i] << "z^" << i;
if (i < f.n - 1) os << " + ";
}
}
return os;
}
#endif
};
//O(2^(deg g) (deg g)^2 log m / 64)
/*
* f(z) g(z)^m
*
* deg f ≦ deg g, 2 deg g < N
*/
template <int N>
ll count_pow_terms(BFPS<N> f, const BFPS<N>& g, ll m) {
// verify : https://projecteuler.net/problem=588
//
// m i m[i] f(z) g(z)^m
// f(z) g(z)^m = f(z) Πi≧0 (g(z)^(2^i))^m[i]
// F_2[z] 2
// f(z) g(z)^m = f(z) Πi≧0 g(z^(2^i))^m[i]
//
//
// 0 i=0
// f(z) g(z)^m[0] = F_e(z^2) + z F_o(z^2)
// i≧1 z^(2^i)
// F_e(z^2) Πi≧1 g(z^(2^i))^m[i]
//
// z F_o(z^2) Πi≧1 g(z^(2^i))^m[i]
//
// F_e(z) Πi≧0 g(z^(2^i))^(m/2)[i]
// F_o(z) Πi≧0 g(z^(2^i))^(m/2)[i]
//
// deg F_e(z), deg F_o(z) ≦ deg g
// deg g bit bitDP
int n = sz(g);
f.resize(n);
vector<BFPS<N>> fs(1LL << n);
repb(set, n) fs[set] = BFPS<N>(bitset<N>(set), n);
vl dp(1LL << n);
dp[f.c.to_ulong()] = 1;
while (m > 0) {
vl ndp(1LL << n);
repb(set, n) {
BFPS<N> f(fs[set]);
if (m % 2 == 1) f *= g;
f.resize(2 * n);
int nset0 = 0;
rep(i, n) nset0 |= (int)f[2 * i] << i;
ndp[nset0] += dp[set];
int nset1 = 0;
rep(i, n) nset1 |= (int)f[2 * i + 1] << i;
ndp[nset1] += dp[set];
}
dp = move(ndp);
m /= 2;
}
ll res = 0;
repb(set, n) res += dp[set] * popcount(set);
return res;
}
//O(?)
/*
* p_ini {{, }, }
* nxt(t, p, nps) t=1:[t=0:] p nps
* nps 1 0
*/
using T = tuple<int, int, int, int, int>;
map<pair<int, T>, int> res;
void decide_WL(const T& p_ini, function<int(int, const T&, vector<T>&)>& nxt) {
// verify : https://atcoder.jp/contests/abc349/tasks/abc349_e
// t=1:[t=0:] p
function<int(int, const T&)> dfs = [&](int t, const T& p) {
//
if (res.count({ t, p })) return res[{t, p}];
// p nps
vector<T> nps;
int wl = nxt(t, p, nps);
// p
if (nps.empty()) {
res[{t, p}] = wl;
return wl;
}
//
res[{t, p}] = 1 - t;
// 1
repe(np, nps) {
if (dfs(1 - t, np) == t) {
res[{t, p}] = t;
}
}
return res[{t, p}];
};
dfs(1, p_ini);
/* nxt
using T = tuple<ll, ll, vl>;
function<int(int, const T&, vector<T>&)> nxt = [&](int t, const T& p, vector<T>& nps) {
ll l, r; vl a;
tie(l, r, a) = p;
return 0;
};
*/
}
void zikken_even() {
function<int(int, const T&, vector<T>&)> nxt = [&](int t, const T& p, vector<T>& nps) {
auto [c0, c1, d0, d1, sc] = p;
if (c0 + c1 == 0) {
if (sc % 2 == 0) return 1;
else return 0;
}
if (c0 > 0 && d0 > 0) {
nps.push_back({ c0 - 1, c1, d0 - 1 , d1, sc });
}
if (c0 > 0 && d1 > 0) {
nps.push_back({ c0 - 1, c1, d0 , d1 - 1, sc });
}
if (c1 > 0 && d0 > 0) {
nps.push_back({ c0, c1 - 1, d0 - 1 , d1, sc });
}
if (c1 > 0 && d1 > 0) {
nps.push_back({ c0, c1 - 1, d0 , d1 - 1, sc + 1 });
}
return 0;
};
repi(n, 1, 10) repi(c0, 0, n) {
int c1 = n - c0;
int d0 = n / 2;
int d1 = n - d0;
T ini = T{ c0, c1, d0, d1, 0 };
decide_WL(ini, nxt);
int g = res[{1, ini}];
// if (g == 0) {
dump("c:", c0, c1, " d:", d0, d1, " :", g);
// }
}
exit(0);
}
void zikken() {
int n = 20;
vvvi dp(n + 1, vvi(n + 1, vi(n + 1)));
dp[0][0][0] = 0b01;
repi(c0, 0, n) repi(c1, 0, n) repi(d0, 0, n) {
if (c0 + c1 == 0) continue;
int d1 = c0 + c1 - d0;
if (d1 < 0 || d1 > n) continue;
int x = 0;
if (c0 > 0 && d0 > 0) {
// even even
// → odd odd 1
x |= getb(~dp[c0 - 1][c1][d0 - 1], 1) << 0;
x |= getb(~dp[c0 - 1][c1][d0 - 1], 0) << 1;
}
if (c0 > 0 && d1 > 0) {
x |= getb(~dp[c0 - 1][c1][d0], 1) << 0;
x |= getb(~dp[c0 - 1][c1][d0], 0) << 1;
}
if (c1 > 0 && d0 > 0) {
x |= getb(~dp[c0][c1 - 1][d0], 1) << 0;
x |= getb(~dp[c0][c1 - 1][d0], 0) << 1;
}
if (c1 > 0 && d1 > 0) {
x |= getb(~dp[c0][c1 - 1][d0], 0) << 0;
x |= getb(~dp[c0][c1 - 1][d0], 1) << 1;
}
dp[c0][c1][d0] = x;
}
// dumpel(dp);
repi(c0, 0, n) {
repi(c1, 0, n) {
int s = c0 + c1;
int d0 = s / 2;
int d1 = s - d0;
int g = dp[c0][c1][d0];
if (g != 0) cout << g << " ";
else cout << "." << " ";
}
cout << endl;
}
//repi(s, 1, n) repi(c0, 0, s) {
// int c1 = s - c0;
// int d0 = s / 2;
// int d1 = s - d0;
// int g = dp[c0][c1][d0];
// dump("c:", c0, c1, " d:", d0, d1, " :", bitset<2>(g));
//}
exit(0);
}
/*
1 2 . 3 3 . . 3 3 . . 3 3 . . 3 3 . . 3 3
1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 3 . . 3 3 . . 3 3 . . 3 3 . .
1 3 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3 . . 3 3
1 3 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3 . .
1 3 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3
1 3 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3 . .
1 3 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . .
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 .
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 .
*/
int solve(ll c0, ll c1) {
ll n = c0 + c1;
ll d0 = n / 2;
ll d1 = n - d0;
// dump(d0, d1);
int res = -1;
if (c1 == 0) {
res = 1;
}
else if (c1 == 1) {
if (c0 == 0) {
res = 2;
}
else {
res = 3;
}
}
else if (c0 >= c1 - 1) {
if ((c0 + c1) % 2 == 0) {
res = 0;
}
else {
res = 3;
}
}
else if (c0 % 2 == 1) {
res = 3;
}
else if (c0 % 4 == 0) {
if (c1 % 4 == 1 || c1 % 4 == 2) {
res = 0;
}
else {
res = 3;
}
}
else {
if (c1 % 4 == 1 || c1 % 4 == 2) {
res = 3;
}
else {
res = 0;
}
}
return res;
}
void check() {
int n = 20;
repi(c0, 0, n) {
repi(c1, 0, n) {
int g = solve(c0, c1);
if (g != 0) cout << g << " ";
else cout << "." << " ";
}
cout << endl;
}
exit(0);
}
/*
1 2 . 3 3 . . 3 3 . . 3 3 . . 3 3 . . 3 3
1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 3 . . 3 3 . . 3 3 . . 3 3 . .
1 3 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3 . . 3 3
1 3 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3 . .
1 3 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3 . . 3 3
1 3 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3 . .
1 3 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . . 3 3
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 . .
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 3 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 .
1 3 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3
1 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 . 3 .
*/
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
// zikken_even();
// zikken();
// check();
int t;
cin >> t;
constexpr int N = 4;
BFPS<N> f(1);
BFPS<N> g(bitset<4>(3), 2);
dump(f); dump(g);
rep(hoge, t) {
ll n; string s;
cin >> n >> s;
ll c1 = count_pow_terms<4>(f, g, n - 1);
ll c0 = n - c1;
dump(c0, c1);
int res = solve(c0, c1);
if (s == "Even") {
cout << ((res & 1) ? "Alice" : "Bob") << endl;
}
else {
cout << ((res & 2) ? "Alice" : "Bob") << endl;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0