oj.uz

Submission #675867

# Submission time Handle Problem Language Result Execution time Memory
675867 2022-12-28T08:48:16 Z Kubeti XORanges (eJOI19_xoranges) C++14
55 / 100
 43 ms 2008 KB 
#include <iostream>
#include <vector>
using namespace std;
int v[100001];
int main() {
    int n, q;
    cin>>n>>q;
    for(int i=1; i<=n; i++)
        cin>>v[i];
    for(int i=0; i<n; i++){
        int t;
        cin>>t;
        if(t == 1){
            int x, y;
            cin>>x>>y;
            v[x] = y;
        }
        else{
            int x, y;
            cin>>x>>y;
            if(abs(x-y)%2 == 1){
                cout<<0<<'\n';
            }
            else{
                int sum=0;
                for(;x<=y;x+=2)
                    sum^=v[x];
                cout<<sum<<'\n';
            }
        }
    }
    return 0;
}
 /*
int main(){
    int n;
    cin>>n;
    vector<vector<int>> v(n+1);
    for(int i=1; i<=n; i++){
        for(int j=i; j<=n; j++){
            for(int x=i; x<=j; x++)
                v[x].push_back(x);
        }
    }
    for(int i=1; i<=n; i++){
        for(auto it:v[i])
            cout<<it<<" ";
        cout<<"-> "<<v[i].size()<<endl;
    }
} */

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 11 ms 340 KB Output is correct
12 Correct 9 ms 340 KB Output is correct
13 Correct 13 ms 332 KB Output is correct
14 Correct 14 ms 356 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 2008 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 11 ms 340 KB Output is correct
12 Correct 9 ms 340 KB Output is correct
13 Correct 13 ms 332 KB Output is correct
14 Correct 14 ms 356 KB Output is correct
15 Runtime error 43 ms 2008 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -