oj.uz

Submission #266469

# Submission time Handle Problem Language Result Execution time Memory
266469 2020-08-15T10:03:45 Z eagle30 XORanges (eJOI19_xoranges) C++14
55 / 100
 1000 ms 5004 KB 
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main(){
long long n, m;
cin>>n>>m;
for(long long i=1; i<=n; i++)
    cin>>arr[i];
long long a, b, c;
for(long long i=0; i<m; i++){
    cin>>a>>b>>c;
    if(a==2){
        long long hi=c-b+1;
        if(hi%2==0)
            cout<<0<<'\n';
        else{
            long long yo=0;
            for(long long j=b; j<=c; j+=2)
                yo=(yo^arr[j]);
            cout<<yo<<'\n';
        }
    }
    else
        arr[b]=c;
}
return 0;
}

Compilation message

xoranges.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization ("O3")
      | 
xoranges.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 22 ms 512 KB Output is correct
12 Correct 22 ms 512 KB Output is correct
13 Correct 37 ms 512 KB Output is correct
14 Correct 30 ms 512 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 5004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory 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 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 22 ms 512 KB Output is correct
12 Correct 22 ms 512 KB Output is correct
13 Correct 37 ms 512 KB Output is correct
14 Correct 30 ms 512 KB Output is correct
15 Execution timed out 1080 ms 5004 KB Time limit exceeded
16 Halted 0 ms 0 KB -