oj.uz

답안 #1092287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092287 2024-09-23T17:18:07 Z TrinhKhanhDung XORanges (eJOI19_xoranges) C++14
100 / 100
 70 ms 10364 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e5 + 10;

struct fen{
    vector<ll> tree;
    int n;

    fen(int _n = 0){
        n = _n;
        tree.resize(n + 3, 0);
    }

    void upd(int p, ll c){
        while(p <= n){
            tree[p] ^= c;
            p += p & -p;
        }
    }

    ll get(int p){
        ll ans = 0;
        while(p){
            ans ^= tree[p];
            p -= p & -p;
        }
        return ans;
    }
};

int N, Q;
int a[MAX];

void solve(){
    cin >> N >> Q;
    fen bit[2];
    bit[0] = bit[1] = fen(N);
    for(int i = 1; i <= N; i++){
        cin >> a[i];
        bit[i & 1].upd(i, a[i]);
    }

    while(Q--){
        int t, x, y; cin >> t >> x >> y;

        if(t == 1){
            bit[x & 1].upd(x, a[x]);
            a[x] = y;
            bit[x & 1].upd(x, a[x]);
        }

        if(t == 2){
            if((y - x + 1) % 2 == 0) cout << 0 << '\n';
            else{
                cout << (bit[x & 1].get(y) ^ bit[x & 1].get(x - 1)) << '\n';
            }
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("cnt-mst.inp","r",stdin);
//     freopen("cnt-mst.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--)
        solve();

    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 10316 KB Output is correct
2 Correct 68 ms 10328 KB Output is correct
3 Correct 69 ms 10356 KB Output is correct
4 Correct 57 ms 10064 KB Output is correct
5 Correct 59 ms 10064 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 70 ms 10316 KB Output is correct
16 Correct 68 ms 10328 KB Output is correct
17 Correct 69 ms 10356 KB Output is correct
18 Correct 57 ms 10064 KB Output is correct
19 Correct 59 ms 10064 KB Output is correct
20 Correct 68 ms 10156 KB Output is correct
21 Correct 63 ms 10064 KB Output is correct
22 Correct 61 ms 10364 KB Output is correct
23 Correct 57 ms 10064 KB Output is correct
24 Correct 58 ms 10068 KB Output is correct