oj.uz

Submission #593434

# Submission time Handle Problem Language Result Execution time Memory
593434 2022-07-11T07:42:23 Z serkanrashid XORanges (eJOI19_xoranges) C++14
100 / 100
 138 ms 11236 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int maxn=2*1e5+5;
int n,q;
int a[maxn],chet[4*maxn],nech[4*maxn];
int ql,qr,val;

void make_tree_chet(int v, int l, int r)
{
    if(l==r)
    {
        if(r%2==0) chet[v]=a[r];
        return;
    }
    int mid=(l+r)/2;
    make_tree_chet(v*2+0,l,mid+0);
    make_tree_chet(v*2+1,mid+1,r);
    chet[v]=chet[v*2]^chet[v*2+1];
}

void make_tree_nech(int v, int l, int r)
{
    if(l==r)
    {
        if(r%2==1) nech[v]=a[r];
        return;
    }
    int mid=(l+r)/2;
    make_tree_nech(v*2+0,l,mid+0);
    make_tree_nech(v*2+1,mid+1,r);
    nech[v]=nech[v*2]^nech[v*2+1];
}

int query_chet(int v, int l, int r)
{
    if(l>qr||r<ql||l>r) return 0;
    if(l>=ql&&r<=qr) return chet[v];
    int mid=(l+r)/2;
    return query_chet(v*2+0,l,mid+0)^query_chet(v*2+1,mid+1,r);
}

int query_nech(int v, int l, int r)
{
    if(l>qr||r<ql||l>r) return 0;
    if(l>=ql&&r<=qr)
    {
        return nech[v];
        cout << nech[v] << " " << v << " " << l << " " << r << endl;
    }
    int mid=(l+r)/2;
    return query_nech(v*2+0,l,mid+0)^query_nech(v*2+1,mid+1,r);
}

void update_chet(int v, int l, int r)
{
    if(l>qr||r<ql||l>r) return;
    if(l>=ql&&r<=qr)
    {
        chet[v]=val;
        return;
    }
    int mid=(l+r)/2;
    update_chet(v*2+0,l,mid+0);
    update_chet(v*2+1,mid+1,r);
    chet[v]=chet[v*2]^chet[v*2+1];
}

void update_nech(int v, int l, int r)
{
    if(l>qr||r<ql||l>r) return;
    if(l>=ql&&r<=qr)
    {
        nech[v]=val;
        return;
    }
    int mid=(l+r)/2;
    update_nech(v*2+0,l,mid+0);
    update_nech(v*2+1,mid+1,r);
    nech[v]=nech[v*2]^nech[v*2+1];
}


void read()
{
    cin >> n >> q;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    make_tree_chet(1,1,n);
    make_tree_nech(1,1,n);
    int ch,l,r,ind,stoy;
    for(int i=1;i<=q;i++)
    {
        cin >> ch;
        if(ch==1)
        {
            cin >> ind >> stoy;
            ql=ind;
            qr=ind;
            val=stoy;
            if(ind%2==0) update_chet(1,1,n);
            else update_nech(1,1,n);
        }
        else
        {
            cin >> l >> r;
            if((r-l+1)%2==0) cout << 0 << endl;
            else
            {
                ql=l;
                qr=r;
                if(l%2==0) cout << query_chet(1,1,n) << endl;
                else cout << query_nech(1,1,n) << endl;
                //cout << "**************************" << endl;
            }
        }
    }
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	read();
return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 5 ms 572 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 11156 KB Output is correct
2 Correct 135 ms 11132 KB Output is correct
3 Correct 126 ms 11236 KB Output is correct
4 Correct 126 ms 10848 KB Output is correct
5 Correct 108 ms 10804 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 5 ms 572 KB Output is correct
15 Correct 134 ms 11156 KB Output is correct
16 Correct 135 ms 11132 KB Output is correct
17 Correct 126 ms 11236 KB Output is correct
18 Correct 126 ms 10848 KB Output is correct
19 Correct 108 ms 10804 KB Output is correct
20 Correct 125 ms 10964 KB Output is correct
21 Correct 135 ms 11064 KB Output is correct
22 Correct 138 ms 10956 KB Output is correct
23 Correct 116 ms 10812 KB Output is correct
24 Correct 107 ms 10884 KB Output is correct