oj.uz

Submission #269603

# Submission time Handle Problem Language Result Execution time Memory
269603 2020-08-17T08:04:17 Z JuliusMieliauskas XORanges (eJOI19_xoranges) C++14
12 / 100
 1000 ms 3192 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<long long>
#define MOD 1000000007
#define endl '\n'

typedef long long ll;

map<int, int> m;

void print(vi v){
    cout<<"Contents of vector:\n";
    for(auto x : v) cout<<x<<" ";
    cout<<endl<<endl;
}

void solve(){
    int n, q; cin>>n>>q;
    int ar[n];
    for(int i = 0; i<n; i++) cin>>ar[i];

    for(int i = 0; i<q; i++){
        int type; cin>>type;
        if(type == 1){
            int ind, v; cin>>ind>>v;
            ar[ind-1] = v;
        } else {
            int u, l; cin>>u>>l;
            int value = ar[u-1];
            for(int j = u; j<l; j++) value ^= ar[j];

            for(int j = 1; j<l; j++){ ///j = range(1 = pair, 2 = three)
                for(int k = u-1; k<l-j; k++){
                    int xo = ar[k];
                    for(int d = k+1; d<k+j+1; d++) xo ^= ar[d];

                    value ^= xo;
                }
            }
            cout<<value<<endl;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    //ifstream cin("input.txt"); ofstream cout("output.txt");///cia failai

    //int T; cin>>T;
    int T = 1;

    for(int it = 1; it<=T; it++){
        solve();

    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 504 KB Output is correct
2 Correct 580 ms 384 KB Output is correct
3 Correct 733 ms 396 KB Output is correct
4 Execution timed out 1098 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 614 ms 504 KB Output is correct
7 Correct 580 ms 384 KB Output is correct
8 Correct 733 ms 396 KB Output is correct
9 Execution timed out 1098 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 614 ms 504 KB Output is correct
7 Correct 580 ms 384 KB Output is correct
8 Correct 733 ms 396 KB Output is correct
9 Execution timed out 1098 ms 384 KB Time limit exceeded
10 Halted 0 ms 0 KB -