oj.uz

Submission #288579

# Submission time Handle Problem Language Result Execution time Memory
288579 2020-09-01T16:17:27 Z FulopMate XORanges (eJOI19_xoranges) C++14
55 / 100
 1000 ms 2580 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n, q; cin>>n>>q;
    vector<int> v = {-1};
    for (int i = 0; i < n; i++)
    {
        int a; cin>>a;
        v.push_back(a);
    }
    for (int asd = 0; asd < q; asd++)
    {
        int type; cin>>type;
        int l, r; cin>>l>>r;
        if(type==1) v[l] = r;
        else
        {
            int rr = 0;
            int len = r-l+1;
            if(len%2==0) cout<<0<<endl;
            else if (len==1)cout<<v[l]<<endl;
            else{
                for(int i = l; i <= l+len/2-1; i+=2){
                    rr ^= v[i];
                }
                for(int i = r; i >= l+len/2; i-=2){
                    rr ^= v[i];
                }
                // if(len > 3)rr ^= v[l+len/2];
                cout<<rr<<endl;
            }
            
        }
    }
    
    return 0;
}

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 384 KB Output is correct
3 Correct 1 ms 384 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 10 ms 648 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 18 ms 512 KB Output is correct
14 Correct 17 ms 512 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 2580 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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 10 ms 648 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 18 ms 512 KB Output is correct
14 Correct 17 ms 512 KB Output is correct
15 Execution timed out 1090 ms 2580 KB Time limit exceeded
16 Halted 0 ms 0 KB -