Submission #553967

#TimeUsernameProblemLanguageResultExecution timeMemory
553967FidanXORanges (eJOI19_xoranges)C++17
0 / 100
472 ms10236 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; const ll inf=(1e18); const ll N=1'000'010; int main(){ ll n, q, i; cin>>n>>q; vector<ll> v(n+1, 0); vector<ll> dp(n+1, 0); for(i=1; i<=n; i++){ cin>>v[i]; dp[i]=(dp[i-1]^v[i]); } while(q--){ ll t; cin>>t; ll l, r; cin>>l>>r; cout<<(dp[r]^dp[l-1])<<endl; } return 0; }
#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...