# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631672 | 2022-08-18T12:07:24 Z | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 1000 ms | 1524 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() 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{ if(y==x) cout<<v[x] <<endl; else{ int res=0; if(((y-x+1)/2)%2==0){ for(int i=x+1;i<=y-1;i++) res^=v[i]; }else res=(v[x]^v[y]); cout <<res <<endl; } } } }
Compilation message
# | 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 | 1 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 | Execution timed out | 1074 ms | 1524 KB | Time limit exceeded |
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 | - |