# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633891 | 2022-08-23T11:38:42 Z | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 474 ms | 3016 KB |
#include <iostream> #include <algorithm> #include <vector> #include <math.h> #include <set> #include <map> #define ll long long #define ff first #define ss second #define pb push_back #define all(x) (x).begin(),(x).end() #define int ll using namespace std; main(){ int n,q; cin >> n>>q; vector <int> v(n+1); for(int i=1;i<=n;i++) cin >>v[i]; while(q--){ int type,x,y; cin >>type >>x >>y; if(type==1) v[x]=y; else{ int res=0; if((y-x)%2==0 && ((y-x+2)/2+(y-x))%2==1){ res=((v[x]^v[x+(y-x+1)/2])^v[y]); }else if(((y-x+1))%2==1){ res^=v[x]; res^=v[y]; }else res=0; cout <<res <<endl; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 474 ms | 3016 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |