結果
問題 | No.1716 Bonus Nim |
ユーザー | riano |
提出日時 | 2021-10-22 22:19:58 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 363 ms / 2,000 ms |
コード長 | 4,167 bytes |
コンパイル時間 | 1,606 ms |
コンパイル使用メモリ | 174,244 KB |
実行使用メモリ | 14,952 KB |
最終ジャッジ日時 | 2023-10-24 13:34:42 |
合計ジャッジ時間 | 7,872 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 247 ms
8,160 KB |
testcase_05 | AC | 256 ms
9,644 KB |
testcase_06 | AC | 251 ms
9,080 KB |
testcase_07 | AC | 259 ms
8,772 KB |
testcase_08 | AC | 253 ms
9,092 KB |
testcase_09 | AC | 256 ms
9,408 KB |
testcase_10 | AC | 252 ms
9,256 KB |
testcase_11 | AC | 250 ms
8,460 KB |
testcase_12 | AC | 258 ms
8,704 KB |
testcase_13 | AC | 291 ms
9,896 KB |
testcase_14 | AC | 251 ms
6,772 KB |
testcase_15 | AC | 54 ms
4,348 KB |
testcase_16 | AC | 2 ms
4,348 KB |
testcase_17 | AC | 2 ms
4,348 KB |
testcase_18 | AC | 2 ms
4,348 KB |
testcase_19 | AC | 1 ms
4,348 KB |
testcase_20 | AC | 2 ms
4,348 KB |
testcase_21 | AC | 2 ms
4,348 KB |
testcase_22 | AC | 340 ms
13,672 KB |
testcase_23 | AC | 342 ms
14,176 KB |
testcase_24 | AC | 329 ms
14,668 KB |
testcase_25 | AC | 363 ms
14,952 KB |
testcase_26 | AC | 325 ms
14,916 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:100:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 100 | for(auto[x,c]:cnt){ | ^
ソースコード
#include <bits/stdc++.h> using namespace std; #define ll long long #define rep(i,n) for(int i=0;i<n;i++) #define Pr pair<ll,ll> #define Tp tuple<int,int,int> #define all(v) v.begin(),v.end() #define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr) using Graph = vector<vector<ll>>; const ll mod = 8e18; template<uint64_t mod> struct modint{ uint64_t val; constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){} constexpr modint operator-() const noexcept{ return modint(*this)=mod-val; } constexpr modint operator+(const modint rhs) const noexcept{ return modint(*this)+=rhs; } constexpr modint operator-(const modint rhs) const noexcept{ return modint(*this)-=rhs; } constexpr modint operator*(const modint rhs) const noexcept{ return modint(*this)*=rhs; } constexpr modint operator/(const modint rhs) const noexcept{ return modint(*this)/=rhs; } constexpr modint &operator+=(const modint rhs) noexcept{ val+=rhs.val; val-=((val>=mod)?mod:0); return (*this); } constexpr modint &operator-=(const modint rhs) noexcept{ val+=((val<rhs.val)?mod:0); val-=rhs.val; return (*this); } constexpr modint &operator*=(const modint rhs) noexcept{ val=val*rhs.val%mod; return (*this); } constexpr modint &operator/=(modint rhs) noexcept{ uint64_t ex=mod-2; modint now=1; while(ex){ now*=((ex&1)?rhs:1); rhs*=rhs,ex>>=1; } return (*this)*=now; } modint & operator++(){ val++; if (val == mod) val = 0; return *this; } modint operator++(int){ modint<mod> res = *this; ++*this; return res; } constexpr bool operator==(const modint rhs) noexcept{ return val==rhs.val; } constexpr bool operator!=(const modint rhs) noexcept{ return val!=rhs.val; } friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{ return os<<(x.val); } friend constexpr istream &operator>>(istream& is,modint& x) noexcept{ uint64_t t; is>>t,x=t; return is; } }; typedef modint<mod> mint; //map add void add(map<ll,ll> &cnt,ll a){ if(cnt.count(a)) cnt[a]++; else cnt[a] = 1; } int main() { riano_; ll ans = -2e18; ll T; cin >> T; rep(ii,T){ ll N; cin >> N; ll s = 0; map<ll,ll> cnt; rep(i,N){ ll a; cin >> a; //s ^= a; add(cnt,a); } for(auto[x,c]:cnt){ if(c%2==1) s = 1; } if(N%2==0&&s==0){ cout << "Bob" << "\n"; } else{ cout << "Alice" << "\n"; } } // ll N,D; cin >> N >> D; // ll p[N],q[N]; // vector<Pr> ps; // rep(i,N){ // cin >> p[i] >> q[i]; // ps.push_back(make_pair(p[i],i)); // } // sort(all(ps)); // rep(i,N){ // rep(j,N){ // if(i==j) continue; // if(q[i]-p[i]+q[j]-p[j]<0) continue; // ans = max(ans,min((-1)*p[i],q[i]-p[i]-p[j])); // } // } // // if(ans!=-2e18){ // // cout << ans << endl; return 0; // // } // ll r = (D-1)%2; // ll s = (D-1)/2; // ll mp = ps[0].first; ll ip = ps[0].second; // ll mp2 = ps[1].first; // rep(i,N){ // rep(j,N){ // if(i==j) continue; // if(q[i]-p[i]+q[j]-p[j]>0) continue; // ll cand = 2e18; // ll last = i; ll sec = j; // if(r==0){ // last = j; sec = i; // } // ll sc = (q[i]-p[i]+q[j]-p[j])*s + (q[i]-p[i])*r; // if(last!=ip) cand = sc - mp; // else cand = sc - mp2; // ll c2 = sc - q[last]; // ll c3 = 2e18; // if(D!=2){ // c3 = c2 +p[last]-q[sec]; // } // cand = min({cand,c2,c3}); // ans = max(ans,cand); // } // } // cout << ans << endl; }