oj.uz

답안 #278179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
278179 2020-08-21T11:10:20 Z EJOI2019Andrew XORanges (eJOI19_xoranges) C++14
55 / 100
 1000 ms 3504 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,q;
cin>>n>>q;
int a[n];
for(int i=0; i<n; ++i)
cin>>a[i];
for(int i=0; i<q; ++i)
{
int type;
cin>>type;
if(type==1)
{
int pos,val;
cin>>pos>>val;
a[pos-1]=val;
}
else
{
int from,to;
cin>>from>>to;
--from;
--to;
int ans(0);
for(int i=from; i<=to; ++i)
{
int freq=(i+1-from)*(to-from+1-i-from);
if(freq%2)
ans^=a[i];
}
cout<<ans<<'\n';
}
}
return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 288 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 3 ms 288 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 24 ms 512 KB Output is correct
13 Correct 48 ms 512 KB Output is correct
14 Correct 46 ms 512 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1067 ms 3504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 3 ms 288 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 24 ms 512 KB Output is correct
13 Correct 48 ms 512 KB Output is correct
14 Correct 46 ms 512 KB Output is correct
15 Execution timed out 1067 ms 3504 KB Time limit exceeded
16 Halted 0 ms 0 KB -