# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466750 | mtxas | XORanges (eJOI19_xoranges) | C++14 | 1 ms | 472 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>
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pll pair<ll, ll>
#define mii map<int, int>
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(x) ((int)x.size())
#define turbo() cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
using namespace std;
/**********************************************************************************
STRUCTS
**********************************************************************************/
/**********************************************************************************
VARIABLES
**********************************************************************************/
#define int ll
const int maxn = 501;
int a[maxn];
int t[maxn<<1];
int startIdRes[maxn];
/**********************************************************************************
FUNCTIONS
**********************************************************************************/
/**********************************************************************************
MAIN
**********************************************************************************/
signed main(){
// _fre();
turbo();
int n, q; cin>>n>>q;
_foreq(i, 1, n) cin>>a[i];
_for(g, 0, q){
int type; cin>>type;
if(type == 1){
int i, val; cin>>i>>val;
a[i] = val;
//cout<<"a["<<i<<"] = "<<val<<endl;
}
else if(type == 2){
int l, r; cin>>l>>r;
// cout<<"query("<<l<<", "<<r<<")\n";
int reply = 0;
_foreq(i, l, r){
int appear = (i-l+1)*(r-i+1);
if(appear&1) reply^= a[i];
}
cout<<reply<<'\n';
}
}
}
Compilation message (stderr)
# | 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... |