oj.uz

Submission #467470

# Submission time Handle Problem Language Result Execution time Memory
467470 2021-08-23T05:37:56 Z Theo830 XORanges (eJOI19_xoranges) C++17
100 / 100
 124 ms 11116 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e9+7;
const int MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ii>
#define f(i,a,b) for(int i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll bit[200005][2];
ll n;
void upd(ll k,ll x,ll pos){
    while(pos <= n){
        bit[pos][x] ^= k;
        pos += pos & -pos;
    }
}
ll query(ll k,ll x){
    ll ans = 0;
    while(k >= 1){
        ans ^= bit[k][x];
        k -= k & -k;
    }
    return ans;
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll q;
    cin>>n>>q;
    ll arr[n];
    f(i,0,n){
        cin>>arr[i];
        upd(arr[i],(i+1) % 2,i+1);
    }
    while(q--){
        ll t,l,r;
        cin>>t>>l>>r;
        if(t == 1){
            upd(arr[l-1],l % 2,l);
            arr[l-1] = r;
            upd(arr[l-1],l % 2,l);
        }
        else{
            ll siz = r - l + 1;
            if(siz % 2 == 0){
                cout<<"0\n";
            }
            else{
                cout<<(query(r,l % 2) ^ query(l-1,l % 2))<<"\n";
            }
        }
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory 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 #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 10908 KB Output is correct
2 Correct 117 ms 10960 KB Output is correct
3 Correct 124 ms 11116 KB Output is correct
4 Correct 107 ms 10572 KB Output is correct
5 Correct 104 ms 10672 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory 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
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct
15 Correct 113 ms 10908 KB Output is correct
16 Correct 117 ms 10960 KB Output is correct
17 Correct 124 ms 11116 KB Output is correct
18 Correct 107 ms 10572 KB Output is correct
19 Correct 104 ms 10672 KB Output is correct
20 Correct 113 ms 10660 KB Output is correct
21 Correct 122 ms 10844 KB Output is correct
22 Correct 115 ms 10692 KB Output is correct
23 Correct 107 ms 10608 KB Output is correct
24 Correct 105 ms 10572 KB Output is correct