結果
問題 | No.3137 Non-Intersect Chord Triangle Game |
ユーザー |
![]() |
提出日時 | 2025-05-02 22:02:54 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 301 ms / 2,000 ms |
コード長 | 2,983 bytes |
コンパイル時間 | 4,032 ms |
コンパイル使用メモリ | 297,044 KB |
実行使用メモリ | 69,280 KB |
最終ジャッジ日時 | 2025-05-02 22:03:08 |
合計ジャッジ時間 | 12,476 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 65 |
ソースコード
// #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;} #include<atcoder/lazysegtree> using namespace atcoder; struct S{ ll val, len; }; S op(S l, S r){return {l.val+r.val, l.len+r.len};} S ee(){return {0,0};} S cp(ll l, S r){ if(l==-1) return r; return {r.len*l, r.len}; } ll mp(ll l, ll r){ if(l==-1) return r; return l; } ll id(){return -1;} void solve(){ ll n,m; cin >> n >> m; V<ll> v; V<tuple<ll,ll,ll>> vv; ll e = 0; rep(i, m){ ll a,b; cin >> a >> b; a--; b--; if(a > b) swap(a, b); if(i == 0){ e = n-a; } (a += e) %= n; (b += e) %= n; if(a > b) swap(a, b); vv.eb(b-a, a, b); } sort(be(vv)); V<S> w(n); rep(i,n) w[i] = {1, 1}; lazy_segtree<S,op,ee,ll,cp,mp,id> seg(w); for(auto [_, L, R]:vv){ seg.set(L, {0,1}); seg.set(R, {0,1}); ll p = seg.prod(L, R).val; if(p) v.eb(p); seg.apply(L+1,R,0); } ll p = seg.all_prod().val; if(p) v.eb(p); string ans = "Aoi"; for(auto x:v) if(x%4==2) ans = "Akane"; cout << ans << endl; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int t=1; // cin >> t; rep(i,t) solve(); }