oj.uz

답안 #464344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464344 2021-08-13T04:06:47 Z tengiz05 XORanges (eJOI19_xoranges) C++17
100 / 100
 156 ms 5388 KB 
#include <bits/stdc++.h>

using i64 = long long;

struct SegmentTree {
    int n;
    std::vector<int> t;
    SegmentTree(int n) : n(n), t(2 * n) {}
    void modify(int p, int val) {
        for (t[p += n] = val; p > 1; p >>= 1) {
            t[p >> 1] = t[p] ^ t[p ^ 1];
        }
    }
    int get(int l, int r) {
        int res = 0;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) {
                res ^= t[l++];
            }
            if (r & 1) {
                res ^= t[--r];
            }
        }
        return res;
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, q;
    std::cin >> n >> q;
    
    std::vector<int> a(n);
    SegmentTree s1(n), s2(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        if (i % 2 == 0) {
            s1.modify(i, a[i]);
        } else {
            s2.modify(i, a[i]);
        }
    }
    
    while (q--) {
        int type;
        std::cin >> type;
        if (type == 1) {
            int p, v;
            std::cin >> p >> v;
            p--;
            if (p % 2 == 0) {
                s1.modify(p, v);
            } else {
                s2.modify(p, v);
            }
            a[p] = v;
        } else {
            int l, r;
            std::cin >> l >> r;
            l--;
            if ((r - l) % 2 == 0) {
                std::cout << 0 << "\n";
            } else if (l % 2 == 0) {
                std::cout << s1.get(l, r) << "\n";
            } else {
                std::cout << s2.get(l, r) << "\n";
            }
        }
    }
    
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 5388 KB Output is correct
2 Correct 156 ms 5388 KB Output is correct
3 Correct 127 ms 5388 KB Output is correct
4 Correct 118 ms 5388 KB Output is correct
5 Correct 122 ms 5364 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 404 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 4 ms 332 KB Output is correct
15 Correct 131 ms 5388 KB Output is correct
16 Correct 156 ms 5388 KB Output is correct
17 Correct 127 ms 5388 KB Output is correct
18 Correct 118 ms 5388 KB Output is correct
19 Correct 122 ms 5364 KB Output is correct
20 Correct 124 ms 4752 KB Output is correct
21 Correct 129 ms 4736 KB Output is correct
22 Correct 139 ms 4796 KB Output is correct
23 Correct 119 ms 5264 KB Output is correct
24 Correct 120 ms 5256 KB Output is correct