Submission #18750318

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

using S = ll;
using F = ll;
const F ID = 0;
S op(S a, S b){ return a^b; }
S e(){ return 0; }
S mapping(F f, S x){
    return f^x;
}
F composition(F f, F g){ return f^g; }
F id(){ return ID; }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll N; cin >> N;
  ll Q; cin >> Q;
  vector<ll> A(N); for (ll i = 0; i < N; i++) cin >> A[i];

  lazy_segtree<S, op, e, F, mapping, composition, id> seg(A);
  for (ll i = 0; i < Q; i++) {
    ll T; cin >> T;
    ll X, Y; cin >> X >> Y;
    if (T == 1) {
      X--;
      seg.apply(X, Y);
    } else {
      X--; Y--;
      ll ans = seg.prod(X, Y + 1);
      cout << ans << '\n';
    }
  }
  return 0;
}

Submission Info

Judge Result