結果
問題 |
No.3258 Xor Division Game
|
ユーザー |
![]() |
提出日時 | 2025-09-05 22:32:38 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 3,548 bytes |
コンパイル時間 | 4,154 ms |
コンパイル使用メモリ | 297,164 KB |
実行使用メモリ | 16,000 KB |
最終ジャッジ日時 | 2025-09-05 22:33:30 |
合計ジャッジ時間 | 14,227 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 67 |
ソースコード
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; template<class T> using V = vector<T>; template<class T> using VV = V<V<T>>; template<class T> using VVV = V<VV<T>>; template<class T> using VVVV = VV<VV<T>>; #define rep(i,n) for(ll i=0ll;(i)<(n);(i)++) #define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++) #define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--) #define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--) const long long INF = (1LL << 60); const long long mod99 = 998244353; const long long mod107 = 1000000007; const long long mod = mod99; #define eb emplace_back #define be(v) (v).begin(),(v).end() #define all(v) (v).begin(),(v).end() #define foa(i,v) for(auto& (i) : (v)) #define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end()) #define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end()) #define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end()) #define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end()) #define LB(x,v) (lower_bound(be(v),(x))-(v).begin()) #define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin()) #define UB(x,v) (upper_bound(be(v),(x))-(v).begin()) #define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin()) #define dout() cout << fixed << setprecision(20) #define randinit() srand((unsigned)time(NULL)) template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; } template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; } ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;} void solve(){ ll n; cin >> n; V<ll> v(n); rep(i,n) cin >> v[i]; { V<ll> w = v; UQ(w); rep(i, n) v[i] = LB(v[i], w); } V<ll> prev(n, -1), next(n, -1); V<ll> last(n, -1); V<ll> cnt(n, 0); rep(i, n){ if(last[v[i]] != -1){ prev[i] = last[v[i]]; next[last[v[i]]] = i; cnt[i] ++; cnt[last[v[i]]] ++; } last[v[i]] = i; } set<pair<ll,ll>> st; st.insert({n-1, 0}); queue<ll> que; ll ans = 0; rep(i, n) if(cnt[i] == 0){ que.push(i); } while(!que.empty()){ ans++; ll mid = que.front(); que.pop(); auto[r,l] = *st.lower_bound({mid, -1}); st.erase({r, l}); if(l == r) continue; if(l != mid) st.insert({mid-1, l}); if(r != mid) st.insert({r, mid+1}); if(r-mid < mid-l){ REP(i,mid+1, r+1) if(prev[i] != -1 and prev[i] < mid){ cnt[i]--; if(cnt[i] == 0) que.push(i); cnt[prev[i]] --; if(cnt[prev[i]] == 0) que.push(prev[i]); next[prev[i]] = -1; prev[i] = -1; } }else{ REP(i,l,mid) if(next[i] != -1 and next[i] > mid){ cnt[i]--; if(cnt[i] == 0) que.push(i); cnt[next[i]] --; if(cnt[next[i]] == 0) que.push(next[i]); prev[next[i]] = -1; next[i] = -1; } } } if(ans%2) cout << "Alice\n"; else cout << "Bob\n"; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int t=1; // cin >> t; rep(i,t) solve(); }