oj.uz

Submission #218062

# Submission time Handle Problem Language Result Execution time Memory
218062 2020-03-31T19:55:27 Z Haunted_Cpp XORanges (eJOI19_xoranges) C++17
38 / 100
 131 ms 10360 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;

const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

const int N = 2e5 + 5;
i64 bit [N][2];

void update (int idx, int delta, int where) {
  for (; idx < N; idx += idx & (- idx)) {
    bit[idx][where] ^= delta;
  }
}

i64 query (int idx, int where) {
  i64 tot = 0;
  for (; idx > 0; idx -= idx & (- idx)) {
    tot ^= bit[idx][where];
  }
  return tot;
  
}

i64 range_sum (int lo, int hi, int where) {
  return query (hi, where) ^ query (lo - 1, where);
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vi a (n);
  FOR (i, 1, n + 1) {
    cin >> a[i];
    update (i, a[i], i & 1);
  }
  while (q--) {
    int t, lo, hi;
    cin >> t >> lo >> hi;
    if (t == 1) {
      // Update
      update (lo, - a[lo] + hi, lo & 1);
      a[lo] = hi;
    } else {
      // Query
      const int T = hi - lo + 1;
      if ((T & 1) == 0) {
        cout << 0 << '\n';
        continue;
      }
      cout << range_sum (lo, hi, lo & 1) << '\n';
    }
  }
  return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 10348 KB Output is correct
2 Correct 120 ms 10360 KB Output is correct
3 Correct 129 ms 10360 KB Output is correct
4 Correct 131 ms 10220 KB Output is correct
5 Correct 116 ms 9976 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -