제출 #543649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
543649		tudor	XORanges (eJOI19_xoranges)	C++17	100 / 100	547 ms	8696 KiB

xoranges

#include <iostream>

using namespace std;
const int nmax = 2e5;

int v[nmax + 1];
int aib[2][nmax + 1];
int n;

void update ( int p, int poz, int val ) {
    for ( ; poz <= n; poz += poz & -poz )
        aib[p][poz] ^= val;
}
int query ( int p, int poz ) {
    int rez = 0;
    for ( ; poz > 0; poz -= poz & -poz )
        rez ^= aib[p][poz];
    return rez;
}
int main () {
    int q, t, x, y;
    cin >> n >> q;
    for ( int i = 1; i <= n; i++ ) {
        cin >> v[i];
        update ( i % 2, i, v[i] );
    }
    for ( int i = 1; i <= q; i++ ) {
        cin >> t >> x >> y;
        if ( t == 1 ) {
            update ( x % 2, x, y ^ v[x] );
            v[x] = y;
        } else {
            if ( x % 2 == y % 2 )
                cout << ( query ( x % 2, x - 1 ) ^ query ( y % 2, y ) ) << '\n';
            else
                cout << 0 << '\n';
            
        }
    }
    
    return 0;
}

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