#800624 (C++14) No.2080 Simple Nim Query

• 問題: No.2080 Simple Nim Query
• ユーザー: umimel
• 提出日時: 2022-09-25 22:08:20
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,178 bytes
• コンパイル時間: 1,905 ms
• コンパイル使用メモリ: 176,992 KB
• 実行使用メモリ: 12,032 KB
• 最終ジャッジ日時: 2024-12-22 14:40:22
• 合計ジャッジ時間: 6,226 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 3 WA * 5

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;
struct SegmentTree{
    ll n;
    vector<pair<ll, bool>> dat;
    SegmentTree(ll n_){
        n = 1;
        while(n < n_) n*=2;
        dat.resize(2*n, {0, false});
    }
    void update(ll k, ll a){
        k += n-1;
        if(a == 1) dat[k] = {1, true};
        else dat[k] = {0, false};
        while(k > 0){
            k = (k-1)/2;
            if(dat[2*k+1].se && dat[2*k+2].se){
                dat[k] = {dat[2*k+1].fi+dat[2*k+2].fi, true};
            }else if(dat[2*k+2].se){
                dat[k] = {dat[2*k+1].fi+dat[2*k+2].fi, false};
            }else{
                dat[k] = {dat[2*k+2].fi, false};
            }
        }
    }
    // the minimun element of [a, b)
    ll query(ll a, ll b){return query_sub(a, b, 0, 0, n).fi;}
    pll query_sub(ll a, ll b, ll k, ll l, ll r){
        if(r <= a || b <= l){
            return {0, true};
        }else if(a <= l && r <= b){
            return dat[k];
        }else{
            pll vl = query_sub(a, b, 2*k+1, l, (l+r)/2);
            pll vr = query_sub(a, b, 2*k+2, (l+r)/2, r);
            if(vl.se && vr.se){
                return {vl.fi+vr.fi, true};
            }else if(vr.se){
                return {vl.fi+vr.fi, false};
            }else{
                return {vr.fi, false};
            }
        }
    }
};
int main(){
    ll n, q;
    cin >> n >> q;
    SegmentTree ST(n);
    rep(i, n){
        ll a;
        cin >> a;
        ST.update(i, a);
    }
    vector<char> ans;
    rep(i, q){
        ll t, x, y;
        cin >> t >> x >> y;
        if(t == 1){
            ST.update(x-1, y);
        }else{
            if(ST.query(x-1, y)%2 == 0){
                ans.pb('F');
            }else{
                ans.pb('S');
            }
        }
    }
    rep(i, (ll)ans.size()) cout << ans[i] << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX