#996408 (C++17) No.2813 Cookie

• 問題: No.2813 Cookie
• ユーザー: 👑 binap
• 提出日時: 2024-07-19 23:17:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 57 ms / 2,000 ms
• コード長: 2,664 bytes
• コンパイル時間: 4,620 ms
• コンパイル使用メモリ: 261,976 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-19 23:17:43
• 合計ジャッジ時間: 7,223 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	46 ms; 5,248 KB
testcase_02	AC	50 ms; 5,376 KB
testcase_03	AC	46 ms; 5,376 KB
testcase_04	AC	54 ms; 5,376 KB
testcase_05	AC	57 ms; 5,376 KB
testcase_06	AC	50 ms; 5,376 KB
testcase_07	AC	54 ms; 5,376 KB
testcase_08	AC	50 ms; 5,376 KB
testcase_09	AC	57 ms; 5,376 KB
testcase_10	AC	55 ms; 5,376 KB
testcase_11	AC	48 ms; 5,376 KB
testcase_12	AC	46 ms; 5,376 KB
testcase_13	AC	44 ms; 5,376 KB
testcase_14	AC	49 ms; 5,376 KB
testcase_15	AC	47 ms; 5,376 KB
testcase_16	AC	47 ms; 5,376 KB
testcase_17	AC	54 ms; 5,376 KB
testcase_18	AC	41 ms; 5,376 KB
testcase_19	AC	44 ms; 5,376 KB
testcase_20	AC	45 ms; 5,376 KB
testcase_21	AC	55 ms; 5,376 KB
testcase_22	AC	42 ms; 5,376 KB
testcase_23	AC	40 ms; 5,376 KB
testcase_24	AC	39 ms; 5,376 KB
testcase_25	AC	48 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB

コンパイルメッセージ

main.cpp: In lambda function:
main.cpp:41:9: warning: control reaches end of non-void function [-Wreturn-type]
   41 |         };
      |         ^

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

void solve(){
	auto g = [&](int x){
		if(x == 0) return 0;
		if(x == 1) return 1;
		if(x == 2) return 1;
		if(x == 3) return 2;
		if(x == 4) return 2;
		if(x == 5) return 4;
		if(x == 6) return 4;
		if(x % 3 == 1) return (x - 1) / 3 * 4 - 2;
		if(x % 3 == 2) return (x - 1) / 3 * 4;
		if(x % 3 == 0) return (x - 1) / 3 * 4;
	};
	int n;
	cin >> n;
	vector<int> a(n);
	cin >> a;
	int res = 0;
	rep(i, n) res ^= g(a[i]);
	if(res == 0) cout << "Bob\n";
	else cout << "Alice\n";
}

int main(){
	int t;
	cin >> t;
	rep(_, t) solve();
	return 0;
}