제출 #462379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462379		gesgha	XORanges (eJOI19_xoranges)	C++17	100 / 100	577 ms	14684 KiB

xoranges

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fr(x, l, r) for(int x = l; x <= r; x++)
#define rf(x, l, r) for(int x = l; x >= r; x--)
#define fe(x, y) for(auto& x : y)

#define fi first
#define se second
#define m_p make_pair
#define pb push_back
#define pw(x) (ull(1) << ull(x))
#define all(x) (x).begin(),x.end()
#define sz(x) (int)x.size()
#define mt make_tuple
#define ve vector

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <ld,ld> pld;

template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template<typename T>
bool umn(T& a, T b) { return a > b ? a = b, 1 : 0; }
template<typename T>
bool umx(T& a, T b) { return a < b ? a = b, 1 : 0; }

const ll inf = 1e18;
const int intf = 1e9;
const ll mod = 1e9 + 7;
const ld eps = 0.00000001;
const ll N  = 2e5 + 5;
const int TP = 2;

ll t[TP][4*N];


void modify(int tp, int pos, int tl, int tr, int v, int val){
    if(tl == tr){
        t[tp][v] = val;
        return;
    }

    int m = (tl + tr) / 2;

    if(pos <= m) modify(tp, pos, tl, m, v*2, val);
    else modify (tp, pos, m + 1, tr, v * 2 + 1, val);
    t[tp][v] = t[tp][v*2]^t[tp][v * 2 + 1];
}


int get(int tp, int l, int r, int tl, int tr, int v){

    if(l > r)return 0;


    if(l == tl && tr == r){
        return t[tp][v];
    }

    int m = (tl + tr)/2;

    return (get(tp, l, min(m, r), tl, m, v*2)^get(tp,max(l, m + 1), r,m + 1, tr, v*2 + 1));
}


int main(){
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#else
//    freopen("mountains.in", "r", stdin);
//    freopen("mountains.out","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif

    int n, q;
    cin >> n >> q;

    fr(i, 0, n - 1){
        int a;
        cin >> a;
        modify((i + 1)%2, i, 0, n - 1,1, a);
    }

    while(q--){
        int tp;
        cin >> tp;
        if(tp == 1){
            int a, pos;
            cin >> pos >> a;
            pos--;
            modify((pos + 1)%2,pos,0,n - 1,1,a);
        }
        else{
            int l, r;
            cin >> l >> r;
            l--;r--;
            int len = r - l + 1;
            if(len%2 == 0){
                cout << 0 << endl;
                continue;
            }
            int t = (l + 1)%2;
//            cout << "t = " << t << endl;
            cout << get(t, l, r,0,n - 1, 1) << endl;
        }
    }
    return 0;
}

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