제출 #1176435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1176435		Albara_Abdulhafith	XORanges (eJOI19_xoranges)	C++20	0 / 100	1092 ms	1412 KiB

xoranges

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

typedef long long ll;
typedef long double ld;

#define fastIO ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define take(x) for(auto& el : x){cin >> el;}
#define give(x) for(auto& el : x){cout << el << ' ';}cout << '\n';
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define rep(i, x) for(int i = 0; i < x; i++)
#define sz(x) ll(x.size())

const ll modu = 998244353ll;

ll mod(ll x, ll md = modu){
    return (((x % md) + md ) % md);
}



void solve(){
    int n, q; cin >> n >> q;

    vector<int> a(n + 1);
    a[0] = 0;
    for(int i = 1; i <= n;i++){
        cin >> a[i];
    }

    int op, l, r;
    for(int i = 0; i < q; i++){
        cin >> op >> l >> r;

        if(op == 1){
            a[l] = r;
        }
        else{
            int res = 0;
            for(int j = l; j <= r; j++){
                if(!((j - l) & 1)){
                    res = (res ^ a[j]);
                }
            }
            cout << res << '\n';
        }
    }
}

int main(){
    fastIO
    int tc = 1;
    //cin >> tc;
    while(tc--){
        solve();
    }
    return 0;
}

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