結果

問題 No.2813 Cookie
ユーザー ecottea
提出日時 2024-07-19 21:45:09
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,917 bytes
コンパイル時間 9,946 ms
コンパイル使用メモリ 276,444 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-19 21:45:22
合計ジャッジ時間 6,636 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 5 WA * 25
権限があれば一括ダウンロードができます

ソースコード

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
//O(n log n)
/*
* mex a[0..n)
*/
int mex(vi a) {
// verify : https://atcoder.jp/contests/abc349/tasks/abc349_g
uniq(a);
a.push_back(INF);
rep(i, sz(a)) if (i != a[i]) return i;
return -1;
}
// k O(PartitionsP(n))n=50
/*
* n k
*/
vvi integer_partitions_val(int n, int k = INF) {
// verify : https://atcoder.jp/contests/abc226/tasks/abc226_f
//
// (n, k) = (6, 3)
// 0: 3 3
// 1: 3 2 1
// 2: 3 1 1 1
// 3: 2 2 2
// 4: 2 2 1 1
// 5: 2 1 1 1 1
// 6: 1 1 1 1 1 1
vvi ips;
map<int, int> ip; // ip[i] : i
// n k
function<void(int, int)> rf = [&](int n, int k) {
//
if (n == 0) {
//
ips.push_back(vi());
for (auto it = ip.rbegin(); it != ip.rend(); it++) {
rep(i, it->second) {
ips.rbegin()->push_back(it->first);
}
}
return;
}
// 使
if (k == 0) {
return;
}
// n k n k n-k
if (n >= k) {
ip[k]++;
rf(n - k, k);
ip[k]--;
if (ip[k] == 0) {
ip.erase(k);
}
}
// n k 使
rf(n, k - 1);
};
rf(n, min(k, n));
return ips;
}
void zikken() {
int n = 50;
vi dp(n);
dp[0] = 0;
repi(i, 1, n - 1) {
vi a{ dp[0] };
auto ips = integer_partitions_val(i, i - 1);
repe(ip, ips) {
int g = 0;
repe(x, ip) g ^= dp[x];
a.push_back(g);
}
dp[i] = mex(a);
}
dump(dp);
exit(0);
}
/*
0 1 1 2 2 4 4 6 8 8 10 12 12 14 16 16 18 20 20 22 24 24 26 28 28
30 32 32 34 36 36 38 40 40 42 44 44 46 48 48 50 52 52 54 56 56 58 60 60 62
*/
void zikken2() {
int n = 50;
vi dp(n);
repi(i, 1, n - 1) {
dp[i] = 2 * (i-2) / 3 * 2;
}
dump(dp);
exit(0);
}
/*
0 0 0 0 2 4 4 6 8 8 10 12 12 14 16 16 18 20 20 22 24 24 26 28 28
30 32 32 34 36 36 38 40 40 42 44 44 46 48 48 50 52 52 54 56 56 58 60 60 62
*/
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
// zikken();
// zikken2();
int t;
cin >> t;
rep(hoge, t) {
int n;
cin >> n;
vl a(n);
cin >> a;
ll g = 0;
rep(i, n) {
if (a[i] == 1) g ^= 1;
else if (a[i] == 2) g ^= 1;
else if (a[i] == 3) g ^= 2;
else g ^= 2 * (2 * a[i] / 3);
}
cout << (g ? "Alice" : "Bob") << "\n";
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0