oj.uz

Submission #547213

# Submission time Handle Problem Language Result Execution time Memory
547213 2022-04-09T20:08:35 Z vlad_TT XORanges (eJOI19_xoranges) C++17
100 / 100
 517 ms 9228 KB 
#include <iostream>

const int MAX_N = 2 * 1e5;
int a[2][1 + MAX_N / 2], aint[2][1 + 4 * MAX_N];

void buildPar(int v, int l, int r) {
  if (l == r) {
    aint[0][v] = a[0][l];
  } else {
    int mid = (l + r) / 2;
    buildPar(2 * v, l, mid);
    buildPar(2 * v + 1, mid + 1, r);
    aint[0][v] = aint[0][2 * v] ^ aint[0][2 * v + 1];
  }
}

void buildImp(int v, int l, int r) {
  if (l == r) {
    aint[1][v] = a[1][l];
  } else {
    int mid = (l + r) / 2;
    buildImp(2 * v, l, mid);
    buildImp(2 * v + 1, mid + 1, r);
    aint[1][v] = aint[1][2 * v] ^ aint[1][2 * v + 1];
  }
}

void updatePar(int v, int l, int r, int pos, int val) {
  if (l == r) {
    aint[0][v] = val;
  } else {
    int mid = (l + r) / 2;
    if (pos <= mid) {
      updatePar(2 * v, l, mid, pos, val);
    } else {
      updatePar(2 * v + 1, mid + 1, r, pos, val);
    }
    aint[0][v] = aint[0][2 * v] ^ aint[0][2 * v + 1];
  }
}

void updateImp(int v, int l, int r, int pos, int val) {
  if (l == r) {
    aint[1][v] = val;
  } else {
    int mid = (l + r) / 2;
    if (pos <= mid) {
      updateImp(2 * v, l, mid, pos, val);
    } else {
      updateImp(2 * v + 1, mid + 1, r, pos, val);
    }
    aint[1][v] = aint[1][2 * v] ^ aint[1][2 * v + 1];
  }
}

int queryPar(int v, int l, int r, int p, int q) {
  if (p > q) {
    return 0;
  } else if (l == p && r == q) {
    return aint[0][v];
  } else {
    int mid = (l + r) / 2;
    return queryPar(2 * v, l, mid, p, std::min(mid, q)) ^ queryPar(2 * v + 1, mid + 1, r, std::max(p, mid + 1), q);
  }
}

int queryImp(int v, int l, int r, int p, int q) {
  if (p > q) {
    return 0;
  } else if (l == p && r == q) {
    return aint[1][v];
  } else {
    int mid = (l + r) / 2;
    return queryImp(2 * v, l, mid, p, std::min(mid, q)) ^ queryImp(2 * v + 1, mid + 1, r, std::max(p, mid + 1), q);
  }
}

int main() {
  int n, q;
  std::cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    std::cin >> a[i % 2][i / 2 + i % 2];
  }
  int len = (n + 1) / 2;
  buildImp(1, 1, len);
  buildPar(1, 1, n - len);
  while (q--) {
    int t;
    std::cin >> t;
    if (t == 1) {
      int pos, val;
      std::cin >> pos >> val;
      if (pos % 2 == 1) {
        updateImp(1, 1, len, (pos + 1) / 2, val);
      } else {
        updatePar(1, 1, n - len, pos / 2, val);
      }
    } else {
      int l, r;
      std::cin >> l >> r;
      if ((r - l + 1) % 2 == 0) {
        std::cout << "0\n";
      } else {
        if (l % 2 == 0) {
          std::cout << queryPar(1, 1, n - len, (l + 1) / 2, (r + 1) / 2) << "\n";
        } else {
          std::cout << queryImp(1, 1, len, (l + 1) / 2, (r + 1) / 2) << "\n";
        }
      }
    }
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 10 ms 468 KB Output is correct
12 Correct 13 ms 532 KB Output is correct
13 Correct 12 ms 528 KB Output is correct
14 Correct 15 ms 540 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 515 ms 9172 KB Output is correct
2 Correct 513 ms 9076 KB Output is correct
3 Correct 517 ms 9228 KB Output is correct
4 Correct 491 ms 8772 KB Output is correct
5 Correct 488 ms 8908 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 10 ms 468 KB Output is correct
12 Correct 13 ms 532 KB Output is correct
13 Correct 12 ms 528 KB Output is correct
14 Correct 15 ms 540 KB Output is correct
15 Correct 515 ms 9172 KB Output is correct
16 Correct 513 ms 9076 KB Output is correct
17 Correct 517 ms 9228 KB Output is correct
18 Correct 491 ms 8772 KB Output is correct
19 Correct 488 ms 8908 KB Output is correct
20 Correct 407 ms 8804 KB Output is correct
21 Correct 411 ms 8860 KB Output is correct
22 Correct 386 ms 8800 KB Output is correct
23 Correct 503 ms 8824 KB Output is correct
24 Correct 490 ms 8824 KB Output is correct