제출 #229729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229729		Coder	XORanges (eJOI19_xoranges)	C++14	12 / 100	1094 ms	3320 KiB

xoranges

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define SZ(x) (int)(x.size())
#define F0(i,n) for(int i=0;i<n;i++)
#define F1(i,n) for(int i=1;i<=n;i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define PR(x) cerr << #x << "=" << (x) << endl;
const int inf = 1000000009;
const double pi = atan(1.0)*4.0;
const double eps = 1e-8;
const int N = 200001;
int i, j, k, m, n;
int a[N];

int main() {
    //freopen("x.in", "r", stdin);

    int q, t;
    cin >> n >> q;
    F1(i, n) cin >> a[i];
    while (q--) {
        cin >> t >> i >> j;
        if (t == 1) {
            a[i] = j;
        } else {
            int ret = 0;
            for (int L = i; L <= j; L++) {
                for (int R = L; R <= j; R++) {
                    for (int x = L; x <= R; x++) ret ^= a[x];
                }
            }
            cout << ret << endl;
        }
    }


    return 0;
}

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