# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650310 | Kenpar | XORanges (eJOI19_xoranges) | C++17 | 1085 ms | 5476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e16;
const int INT_INF = 1e9;
const ll MAX = 1e6+1;
void solve(){
ll n,q;
cin>>n>>q;
ll arr[n];
for(int i = 0; i < n; i++) cin>>arr[i];
while(q--){
ll a,b,c;
cin>>a>>b>>c;
if(a == 2){
b--;
c--;
ll ans = 0;
for(int i = b; i <= c; i+=2){
ans ^= arr[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |