oj.uz

Submission #1078438

# Submission time Handle Problem Language Result Execution time Memory
1078438 2024-08-27T17:24:35 Z steveonalex XORanges (eJOI19_xoranges) C++17
100 / 100
 80 ms 8824 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
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 T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


struct FenwickTree{
    int n;
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] ^= v;
            i += LASTBIT(i);
        }
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans ^= a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }

    int get(int l, int r){
        return get(r) ^ get(l-1);
    }
};

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, q; cin >> n >> q;
    vector<int> a(n+1);
    for(int i = 1; i<=n; ++i) cin >> a[i];

    FenwickTree bit1(n), bit2(n);
    for(int i = 1; i<=n; ++i) if (i % 2) bit1.update(i, a[i]);
        else bit2.update(i, a[i]);

    while(q--){
        int type; cin >> type;
        if (type == 2){
            int l, r; cin >> l >> r;
            if ((r - l + 1) % 2){
                if (l % 2) cout << bit1.get(l, r) << "\n";
                else cout << bit2.get(l, r) << "\n";
            }
            else cout << 0 << "\n";
        }
        else{
            int i, x; cin >> i >> x;
            if (i % 2) bit1.update(i, a[i] ^ x);
            else bit2.update(i, a[i] ^ x);
            a[i] = x;
        }
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 2 ms 604 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 8824 KB Output is correct
2 Correct 64 ms 8784 KB Output is correct
3 Correct 70 ms 8656 KB Output is correct
4 Correct 57 ms 8348 KB Output is correct
5 Correct 69 ms 8532 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 65 ms 8824 KB Output is correct
16 Correct 64 ms 8784 KB Output is correct
17 Correct 70 ms 8656 KB Output is correct
18 Correct 57 ms 8348 KB Output is correct
19 Correct 69 ms 8532 KB Output is correct
20 Correct 64 ms 8528 KB Output is correct
21 Correct 61 ms 8560 KB Output is correct
22 Correct 61 ms 8528 KB Output is correct
23 Correct 80 ms 8276 KB Output is correct
24 Correct 59 ms 8292 KB Output is correct