답안 #999871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999871 2024-06-16T07:48:40 Z coolboy19521 XORanges (eJOI19_xoranges) C++17
100 / 100
98 ms 14108 KB
#pragma GCC optimize("Ofast")
#include"bits/stdc++.h"

#define int long long

using namespace std;

const int sz = 2e5 + 10;

int st[2][sz * 4], a[sz];

void build(int le, int ri, int v, int x) {
    if (le == ri) {
        if (le % 2 == x) {
            st[x][v] = a[le];
        }
        return;
    }
    int mi = le + (ri - le) / 2;
    build(le, mi, v * 2, x);
    build(mi + 1, ri, v * 2 + 1, x);
    st[x][v] = st[x][v * 2] ^ st[x][v * 2 + 1];
}

void update(int le, int ri, int ix, int v, int k, int x) {
    if (le > ix || ri < ix) return;
    if (le == ix && ix == ri) {
        st[x][v] = k;
        return;
    }
    int mi = le + (ri - le) / 2;
    update(le, mi, ix, v * 2, k, x);
    update(mi + 1, ri, ix, v * 2 + 1, k, x);
    st[x][v] = st[x][v * 2] ^ st[x][v * 2 + 1];
}

int query(int le, int ri, int ql, int qr, int v, int x) {
    if (le > qr || ri < ql) return 0;
    if (ql <= le && ri <= qr) return st[x][v];
    int mi = le + (ri - le) / 2;
    int lq = query(le, mi, ql, qr, v * 2, x);
    int rq = query(mi + 1, ri, ql, qr, v * 2 + 1, x);
    return lq ^ rq;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }

    build(1, n, 1, 0);
    build(1, n, 1, 1);

    while (q --) {
        int t, le, ri;
        cin >> t >> le >> ri;
        if (1 == t) {
            update(1, n, le, 1, ri, le % 2);
        } else {
            int d = ri - le + 1;
            if (d % 2) {
                cout << query(1, n, le, ri, 1, le % 2) << '\n';
            } else {
                cout << "0\n";
                // int lq = query(1, n, le, ri - d / 2, 1, (le + 1) % 2);
                // int rq = query(1, n, le + d / 2, ri, 1, (le) % 2);
                // cout << (lq ^ rq) << '\n';
            }
        }
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 14108 KB Output is correct
2 Correct 76 ms 13904 KB Output is correct
3 Correct 74 ms 13904 KB Output is correct
4 Correct 69 ms 14076 KB Output is correct
5 Correct 66 ms 13908 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 76 ms 14108 KB Output is correct
16 Correct 76 ms 13904 KB Output is correct
17 Correct 74 ms 13904 KB Output is correct
18 Correct 69 ms 14076 KB Output is correct
19 Correct 66 ms 13908 KB Output is correct
20 Correct 98 ms 13396 KB Output is correct
21 Correct 75 ms 13392 KB Output is correct
22 Correct 79 ms 13396 KB Output is correct
23 Correct 67 ms 13908 KB Output is correct
24 Correct 70 ms 13904 KB Output is correct