Submission #1219621

#	Time	Username	Problem	Language	Result	Execution time	Memory
1219621		khome	XORanges (eJOI19_xoranges)	C++20	38 / 100	286 ms	59580 KiB

xoranges

#include<bits/stdc++.h>
using namespace std;
#define int long long

// const int INF = 1e18;
const int NEU = 0;

int rec(int l, int r, vector<vector<int>> &v){
    int ans = 0;

    for (int j = 0; j < 32; j++){
        int cur = v[r][31-j] - v[l-1][31-j];
        cur %= 2;
        
        ans += cur * (1<<j);
    }

    return ans;

}

void add(vector<vector<int>> &v, int id, int x){
    for (int i = 0; i <= 31; i++){
        v[id][31-i] = min(1ll, x & (1<<i)) + v[id-1][31-i];
    }
    return;
}

void solve(){
    int n, q; cin >> n >> q;
    vector<vector<int>> toq((n+1)/2+1, vector<int>(32));
    vector<vector<int>> juft(n/2+1, vector<int>(32));

    for (int i = 0 ; i < n; i++) {
        int x; cin >> x;
        if (i%2==0) add(toq, i/2+1, x);
        if (i%2==1) add(juft, i/2+1, x);
    }

    for (int i = 0; i < q; i++) {
        int p, l, r; cin >> p >> l >> r;
        if (p == 1) {
            if (l%2 == 1) {
                for (int j = (l-1)/2 + 2; j < (n+1)/2+1; j++){
                    for (int w = 0; w <= 31; w++){
                        toq[j][31-w] += min(1ll, r & (1<<w)) - toq[(l-1)/2+1][31-w];
                    }
                }
                add(toq, (l-1)/2+1, r);

                for (auto i : toq){
                    for (int j : i) cerr << j; cerr << endl;
                }cerr << endl;
            }
            else {
                for (int j = (l-1)/2 + 2; j < n/2+1; j++){
                    for (int w = 0; w <= 31; w++){
                        juft[j][31-w] += min(1ll, r & (1<<w)) - juft[(l-1)/2+1][31-w];
                    }
                }
                add(juft, (l-1)/2+1, r);

                for (auto i : juft){
                    for (int j : i) cerr << j; cerr << endl;
                }cerr << endl;
            }

        }

        else {
            if ((r-l+1) % 2 == 0) cout << 0 << endl;
            else{
                if (l%2 == 1) {
                    cout << rec((l-1)/2+1, (r-1)/2+1, toq);
                }
                if (l%2 == 0) {
                    cout << rec((l-1)/2+1, (r-1)/2+1, juft);
                }
            }
            cout << endl;
        }
    }
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;

    // cin >> t;
    while(t--)solve();
}

• Subtask 1: 0 / 12
• Subtask 2: 18 / 18
• Subtask 3: 0 / 25
• Subtask 4: 20 / 20
• Subtask 5: 0 / 25