Submission #269603

#TimeUsernameProblemLanguageResultExecution timeMemory
269603JuliusMieliauskasXORanges (eJOI19_xoranges)C++14
12 / 100
1098 ms3192 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() #define vi vector<int> #define vll vector<long long> #define MOD 1000000007 #define endl '\n' typedef long long ll; map<int, int> m; void print(vi v){ cout<<"Contents of vector:\n"; for(auto x : v) cout<<x<<" "; cout<<endl<<endl; } void solve(){ int n, q; cin>>n>>q; int ar[n]; for(int i = 0; i<n; i++) cin>>ar[i]; for(int i = 0; i<q; i++){ int type; cin>>type; if(type == 1){ int ind, v; cin>>ind>>v; ar[ind-1] = v; } else { int u, l; cin>>u>>l; int value = ar[u-1]; for(int j = u; j<l; j++) value ^= ar[j]; for(int j = 1; j<l; j++){ ///j = range(1 = pair, 2 = three) for(int k = u-1; k<l-j; k++){ int xo = ar[k]; for(int d = k+1; d<k+j+1; d++) xo ^= ar[d]; value ^= xo; } } cout<<value<<endl; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); //ifstream cin("input.txt"); ofstream cout("output.txt");///cia failai //int T; cin>>T; int T = 1; for(int it = 1; it<=T; it++){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...