oj.uz

Submission #811670

# Submission time Handle Problem Language Result Execution time Memory
811670 2023-08-07T05:19:51 Z taher XORanges (eJOI19_xoranges) C++17
100 / 100
 107 ms 14140 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "C:\GCC\debug.h"
#else
#define debug(...) void(42)
#endif

struct SegTree {
  public:
  int n;
  vector<array<int, 2>> st;
  vector<int> init;

  SegTree(int _n, vector<int> _init) : n(_n), init(_init) {
    st.resize(4 * n);
  }

  array<int, 2> Combine(array<int, 2> x, array<int, 2> y) {
    array<int, 2> z;
    z[0] = x[0] ^ y[0];
    z[1] = x[1] ^ y[1];
    return z;
  }

  void update(int v, int l, int r, int pos, int nv) {
    if (l == r) {
      if (l % 2 == 0) {
        st[v][0] = nv;
      } else {
        st[v][1] = nv;
      }
      return ;
    }

    int mid = l + (r - l) / 2;
    if (pos <= mid) {
      update(v * 2, l, mid, pos, nv);
    } else {
      update(v * 2 + 1, mid + 1, r, pos, nv);
    }
    st[v] = Combine(st[v * 2], st[v * 2 + 1]);
  }

  int get(int v, int l, int r, int low, int high, int parity) {
    if (l == low && r == high) {
      return st[v][parity];
    }

    int mid = l + (r - l) / 2;

    if (high <= mid) {
      return get(v * 2, l, mid, low, high, parity);
    } else if (low > mid) {
      return get(v * 2 + 1, mid + 1, r, low, high, parity);
    }
    return get(v * 2, l, mid, low, mid, parity) ^
          get(v * 2 + 1, mid + 1, r, mid + 1, high, parity);
  }

  void build(int v, int l, int r) {
    if (l == r) {
      if (l % 2 == 0) {
        st[v][0] = init[l];
        st[v][1] = 0;
      } else {
        st[v][0] = 0;
        st[v][1] = init[l];
      }
      return ;
    }

    int mid = l + (r - l) / 2;
    build(v * 2, l, mid);
    build(v * 2 + 1, mid + 1, r);
    st[v] = Combine(st[v * 2], st[v * 2 + 1]);
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;

  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  SegTree st(n, a);
  st.build(1, 0, n - 1);

  for (int i = 0; i < q; i++) {
    int type;
    cin >> type;

    if (type == 1) {
      int x, y;
      cin >> x >> y;
      --x;
      a[x] = y;
      st.update(1, 0, n - 1, x, y);
    } else {
      int l, r;
      cin >> l >> r;
      --l, --r;

      if (l == r) {
        cout << a[l] << '\n';
      } else {
        int seg_length = r - l + 1;
        if (seg_length % 2 == 1) {
          cout << st.get(1, 0, n - 1, l, r, l % 2) << '\n';
        } else {
          cout << 0 << '\n';
        }
      }
    }
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 11160 KB Output is correct
2 Correct 92 ms 14092 KB Output is correct
3 Correct 107 ms 14140 KB Output is correct
4 Correct 86 ms 13796 KB Output is correct
5 Correct 84 ms 13820 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 97 ms 11160 KB Output is correct
16 Correct 92 ms 14092 KB Output is correct
17 Correct 107 ms 14140 KB Output is correct
18 Correct 86 ms 13796 KB Output is correct
19 Correct 84 ms 13820 KB Output is correct
20 Correct 91 ms 13916 KB Output is correct
21 Correct 93 ms 13916 KB Output is correct
22 Correct 99 ms 13928 KB Output is correct
23 Correct 85 ms 13748 KB Output is correct
24 Correct 86 ms 13744 KB Output is correct