제출 #439122

#제출 시각아이디문제언어결과실행 시간메모리
439122elazarkorenXORanges (eJOI19_xoranges)C++17
12 / 100
1075 ms3096 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

int main() {
    int n, q;
    cin >> n >> q;
    vi a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int i, x;
            cin >> i >> x;
            a[i] = x;
            continue;
        }
        int l, r;
        cin >> l >> r;
        int ans = 0;
        for (int i = 1; i <= r - l + 1; i++) {
            for (int j = l; j + i - 1 <= r; j++) {
                for (int k = j; k < j + i; k++) {
                    ans ^= a[k];
                }
            }
        }
        cout << ans << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...