oj.uz

답안 #217688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217688 2020-03-30T12:32:46 Z Sho10 XORanges (eJOI19_xoranges) C++14
75 / 100
 1000 ms 15200 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],tx[200005],lx[200005],rx[200005],verif=-1;
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];
}
}
for(ll i=q-1;i>=0;i--)
{
 cin>>tx[i]>>lx[i]>>rx[i];
 if(tx[i]==1){
    verif=1;
 }
}
if(verif==-1){
while(q--){
        ll t;
    t=tx[q];
    l=lx[q];
    r=rx[q];
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;
}
}
}
}
}else {
while(q--){
        ll t;
    t=tx[q];
    l=lx[q];
    r=rx[q];
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 {
for(ll i=l+1;i<=r;i++)
{
    if(s1%2==0){
        val=((val^a[i]));
        s1++;
    }else {
    s1++;
    }
}
cout<<val<<endl;
}
}
}
}
}

Compilation message

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

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 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 4 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 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
25.0 / 25.0

# 결과 실행 시간 메모리 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 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 11 ms 640 KB Output is correct
12 Correct 9 ms 640 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 18 ms 640 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 10872 KB Output is correct
2 Correct 116 ms 10872 KB Output is correct
3 Correct 116 ms 11000 KB Output is correct
4 Correct 108 ms 10872 KB Output is correct
5 Correct 105 ms 10872 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 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 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 11 ms 640 KB Output is correct
12 Correct 9 ms 640 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 18 ms 640 KB Output is correct
15 Correct 112 ms 10872 KB Output is correct
16 Correct 116 ms 10872 KB Output is correct
17 Correct 116 ms 11000 KB Output is correct
18 Correct 108 ms 10872 KB Output is correct
19 Correct 105 ms 10872 KB Output is correct
20 Execution timed out 1096 ms 15200 KB Time limit exceeded
21 Halted 0 ms 0 KB -