제출 #638559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638559		ShirleyM	XORanges (eJOI19_xoranges)	C++14	55 / 100	1069 ms	2096 KiB

xoranges

#include <bits/stdc++.h>
using namespace std;
#define int int64_t
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
#define x first
#define y second
#define pb push_back
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(a) a.begin(),a.end()
#define fast {ios_base::sync_with_stdio(false); cin.tie(0);}
const int inf = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;

int32_t main() {
    fast;
    int n,q; cin >> n >> q;
    vi a(n); loop(i,0,n) cin >> a[i];
    loop(i,0,q){
        int op; cin >> op;
        if(op==1){
            int ind, val; cin >> ind >> val;
            ind--;
            a[ind] = val;
        }
        else{
            int l,r; cin >> l >> r; l--; r--;
            int ans = 0;
            if((r-l+1)%2 != 0) {
                loop(ind, l, r + 1) {
                    if ((ind - l) % 2 == 0) ans ^= a[ind];
                }
            }
            cout << ans << endl;
        }
    }
    return 0;
}

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