Submission #986931

#	Time	Username	Problem	Language	Result	Execution time	Memory
986931		arush_agu	XORanges (eJOI19_xoranges)	C++17	100 / 100	117 ms	18120 KiB

xoranges

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

template <typename T, T I, T (*F)(T, T)>
struct ST {
  int n;
  vector<T> a, t;

  ST(int n, vector<T> a) : n(n), a(a) {
    t = vector<T>(4 * n);

    build(0, 0, n - 1);
  }

  void build(int idx, int l, int r) {
    if (l == r) {
      t[idx] = a[l];
      return;
    }

    int mid = (l + r) / 2;
    build(2 * idx + 1, l, mid), build(2 * idx + 2, mid + 1, r);
    t[idx] = F(t[2 * idx + 1], t[2 * idx + 2]);
  }

  T query(int ql, int qr, int idx = 0, int l = 0, int r = - 1) {
    if (r == -1) r = n - 1;

    if (ql > r || l > qr) return I;
    if (ql <= l && r <= qr) return t[idx];

    int mid = (l + r) / 2;
    return F(query(ql, qr, 2 * idx + 1, l, mid), query(ql, qr, 2 * idx + 2, mid + 1, r));
  }

  void upd(int qi, T qv, int idx = 0, int l = 0, int r = -1) {
    if (r == -1) r = n - 1;

    if (!(l <= qi && qi <= r)) return;
    if (l == r) {
      t[idx] = qv;
      return;
    }

    int mid = (l + r) / 2;
    upd(qi, qv, 2 * idx + 1, l, mid), upd(qi, qv, 2 * idx + 2, mid + 1, r);

    t[idx] = F(t[2 * idx + 1], t[2 * idx + 2]);
  }
};

ll xor_f(ll a, ll b) { return a ^ b; }

void solve() {
  int n, q; cin >> n >> q;
  vl a(n); for (ll &x : a) cin >> x;

  vl ev, odd;
  for (int i=0; i<n; i++) {
    if (i % 2 == 0) ev.push_back(a[i]);
    else odd.push_back(a[i]);
  }

  ST<ll, 0, xor_f> st1(ev.size(), ev);
  ST<ll, 0, xor_f> st2(odd.size(), odd);

  while (q--) {
    ll t, p1, p2; cin >> t >> p1 >> p2;
    if (t == 1) {
      p1--;
      if (p1 % 2 == 0) st1.upd(p1 / 2, p2);
      else st2.upd(p1 / 2, p2);
    } else {
      p1--, p2--;
      if ((p2 - p1 + 1) % 2 == 0) cout << "0\n";
      else {
        if (p1 % 2 == 0) cout << st1.query(p1 / 2, p2 / 2) << "\n";
        else cout << st2.query(p1 / 2, p2 / 2) << "\n";
      }
    }
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

xoranges.cpp: In function 'int main()':
xoranges.cpp:179:11: warning: unused variable 'start' [-Wunused-variable]
  179 |   clock_t start = clock();
      |           ^~~~~

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 25 / 25
• Subtask 4: 20 / 20
• Subtask 5: 25 / 25