Submission #815701

#	Time	Username	Problem	Language	Result	Execution time	Memory
815701		AndrijaM	XORanges (eJOI19_xoranges)	C++14	0 / 100	436 ms	11632 KiB

xoranges

#include<bits/stdc++.h>
#include<math.h>

#define _USE_MATH_DEFINES

using namespace std;

struct segTree {
    vector<int> seg;
    int n;
    void build(int s, int e, int curr, vector<int>& v) {
        if (s == e) {
            seg[curr] = v[s];
            return;
        }
        int mid = (s + e) / 2;

        build(s, mid, curr * 2 + 1, v);
        build(mid + 1, e, curr * 2 + 2, v);

        seg[curr] = seg[curr * 2 + 1] ^ seg[curr * 2 + 2];
    }

    void build(vector<int> &v){
        build(0, n - 1, 0, v);
    }

    segTree(vector<int> v) {
        n = v.size();
        seg.resize(4 * n, 0); // 2 * pow(2, log2(n)) - 1;
        build(v);
    }

    int query(int s, int e, int curr, int rS, int rE){
        if(e < rS || s > rE) return 0;
        else if(s >= rS && e <=rE){
            return seg[curr];
        }
        else {
            int mid = (s + e) / 2;
            int q1 = query(s, mid, curr * 2 + 1, rS, rE);
            int q2 = query(mid + 1, e, curr * 2 + 2, rS, rE);

            return q1 ^ q2;

        }
    }

    int query(int rS, int rE){
        return query(0, n-1, 0, rS, rE);
    }

    void update(int s, int e, int curr, int index, int val){
        if(s == e) {
            seg[curr] = val;
            return;
        }
        int mid = (s + e) / 2;
        if(index <= mid){
            update(s, mid, curr * 2 + 1, index, val);
        }
        else{
            update(mid + 1, e, curr * 2 + 2, index, val);
        }

        seg[curr] = seg[curr * 2 + 1] ^ seg[curr * 2 + 2];

    }

    void update(int index, int val){
        update(0, n-1, 0, index, val);
    }
};


int main()
{
    int n,m;
    cin>>n>>m;
    int x[n];
    vector<int>a1;
    vector<int>a2;
    for(int i=0;i<n;i++)
    {
        cin>>x[i];
        if(i%2==0)
        {
            a1.push_back(x[i]);
            a2.push_back(0);
        }
        else
        {
            a1.push_back(0);
            a2.push_back(x[i]);
        }
    }
    segTree st1(a1);
    segTree st2(a2);
    while(m--)
    {
        int k;
        cin>>k;
        if(k==1)
        {
            int idx;
            int nval;
            cin>>idx>>nval;
            idx--;
            if(idx%2==0)
            st1.update(idx,nval);
            else
            st2.update(idx,nval);
        }
        else{
            int l,r;
            cin>>l>>r;
            l--;
            r--;
            if(l%2==0)
            cout<<st1.query(l,r)<<endl;
            else
            cout<<st2.query(l,r)<<endl;
        }
    }
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 25
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25