제출 #1281986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281986		SSKMF	XORanges (eJOI19_xoranges)	C++20	100 / 100	55 ms	4556 KiB

xoranges

#include <bits/stdc++.h>
using namespace std;

int sir[200001] , suma[2][200001];

int main ()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int lungime , numar_operatii;
    cin >> lungime >> numar_operatii;

    for (int indice = 1 ; indice <= lungime ; indice++)
    {
        cin >> sir[indice];

        suma[indice & 1][indice] ^= sir[indice];
        if (indice + (indice & -indice) <= lungime)
        { 
            suma[0][indice + (indice & -indice)] ^= suma[0][indice];
            suma[1][indice + (indice & -indice)] ^= suma[1][indice];
        }
    }

    while (numar_operatii--)
    {
        int8_t tip;
        cin >> tip;

        if (tip == '1')
        {
            int indice , valoare;
            cin >> indice >> valoare;

            valoare ^= sir[indice];
            for (int __indice = indice ; __indice <= lungime ; __indice += (__indice & -__indice))
                { suma[indice & 1][__indice] ^= valoare; }

            sir[indice] ^= valoare;
        }
        else
        {
            int stanga , dreapta;
            cin >> stanga >> dreapta;

            if ((dreapta - stanga + 1) % 2 == 0)
                { cout << "0\n"; continue; }

            stanga--;
            int __suma = 0;
            const int __indice = (dreapta & 1);
            while (stanga != dreapta) {
                if (stanga < dreapta) { __suma ^= suma[__indice][dreapta]; dreapta ^= (dreapta & -dreapta); }
                else { __suma ^= suma[__indice][stanga]; stanga ^= (stanga & -stanga); }
            }

            cout << __suma << '\n';
        }
    }
    
    return 0;
}

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