oj.uz

Submission #229733

# Submission time Handle Problem Language Result Execution time Memory
229733 2020-05-06T08:14:05 Z Coder XORanges (eJOI19_xoranges) C++14
100 / 100
 773 ms 8112 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define PR(x) cerr << #x << "=" << (x) << endl;
const int inf = 1000000009;
const double pi = atan(1.0)*4.0;
const double eps = 1e-8;
const int N = 200001;
int i, j, k, m, n;
int a[N];

int h[2][N];
void add(int ind, int x, int val) {
    while (x <= n) {
        h[ind][x] ^= val;
        x = (x|(x-1)) + 1;
    }
}
int get(int ind, int x) {
    int ret = 0;
    while (x) {
        ret ^= h[ind][x];
        x &= (x-1);
    }
    return ret;
}
int main() {
    //freopen("x.in", "r", stdin);

    int q, t;
    cin >> n >> q;
    F1(i, n) {
        cin >> a[i];
        add(i % 2, (i + 1) / 2, a[i]);
    }
    while (q--) {
        cin >> t >> i >> j;
        if (t == 1) {
            add(i % 2, (i + 1) / 2, a[i]);
            a[i] = j;
            add(i % 2, (i + 1) / 2, a[i]);
        } else {
            int len = j - i + 1;
            int ret = 0;
            if (len % 2) {
                ret = get(j % 2, (j + 1) / 2) ^ get(i % 2, (i - 1) / 2);
            }
            cout << ret << endl;
        }
    }


    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 256 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 18 ms 384 KB Output is correct
12 Correct 18 ms 384 KB Output is correct
13 Correct 21 ms 384 KB Output is correct
14 Correct 21 ms 384 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 768 ms 5040 KB Output is correct
2 Correct 755 ms 8112 KB Output is correct
3 Correct 773 ms 8056 KB Output is correct
4 Correct 733 ms 7672 KB Output is correct
5 Correct 740 ms 7800 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 18 ms 384 KB Output is correct
12 Correct 18 ms 384 KB Output is correct
13 Correct 21 ms 384 KB Output is correct
14 Correct 21 ms 384 KB Output is correct
15 Correct 768 ms 5040 KB Output is correct
16 Correct 755 ms 8112 KB Output is correct
17 Correct 773 ms 8056 KB Output is correct
18 Correct 733 ms 7672 KB Output is correct
19 Correct 740 ms 7800 KB Output is correct
20 Correct 566 ms 7800 KB Output is correct
21 Correct 566 ms 7800 KB Output is correct
22 Correct 580 ms 7672 KB Output is correct
23 Correct 711 ms 7800 KB Output is correct
24 Correct 715 ms 7672 KB Output is correct