제출 #838128

#제출 시각아이디문제언어결과실행 시간메모리
838128BlockOGXORanges (eJOI19_xoranges)C++14
0 / 100
1044 ms1624 KiB
#include <iostream>

using namespace std;

int main() {
    int n, q; cin >> n >> q;
    unsigned int o[n]; for (int i = 0; i < n; i++) cin >> o[i];

    for (int it = 0; it < q; it++) {
        int code; cin >> code;
        if (code == 1) {
            int i; cin >> i >> o[--i];
        } else {
            int u, l; cin >> u >> l;
            if (!((u - l + 1) & 1)) continue;

            unsigned int res = 0;
            for (int i = u - 1; i < l; i += 2) {
                res ^= o[i];
            }
            cout << res << endl;
        }
    }
}
#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...