oj.uz

Submission #217687

# Submission time Handle Problem Language Result Execution time Memory
217687 2020-03-30T12:28:33 Z Sho10 XORanges (eJOI19_xoranges) C++14
38 / 100
 125 ms 11132 KB 
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,q,a[200005],l,r,xorpar[200005],xorimpar[200005];
int32_t main(){
CODE_START;
cin>>n>>q;
xorpar[0]=0;
xorimpar[0]=0;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
    if(i%2==1){
        xorimpar[i]=(xorimpar[i-1]^a[i]);
        xorpar[i]=xorpar[i-1];
    }else {
        xorpar[i]=(xorpar[i-1]^a[i]);
        xorimpar[i]=xorimpar[i-1];
}
}
while(q--){
        ll t;
    cin>>t>>l>>r;
if(t==1){
    a[l]=r;
}else if(t==2){
ll s1=1;
ll val=a[l];
if(l%2!=r%2){
    cout<<0<<endl;
}else {
if(l%2==1){
    cout<<(xorimpar[r]^xorimpar[l-1])<<endl;
}else {
cout<<(xorpar[r]^xorpar[l-1])<<endl;
}
}
}
}
}

Compilation message

xoranges.cpp: In function 'int32_t main()':
xoranges.cpp:47:4: warning: unused variable 's1' [-Wunused-variable]
 ll s1=1;
    ^~
xoranges.cpp:48:4: warning: unused variable 'val' [-Wunused-variable]
 ll val=a[l];
    ^~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 6288 KB Output is correct
2 Correct 125 ms 11060 KB Output is correct
3 Correct 114 ms 11132 KB Output is correct
4 Correct 103 ms 10744 KB Output is correct
5 Correct 107 ms 10744 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -