Submission #18739894


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 3e5 + 10;
int c[N];

void add(int x, int y) {
  for (; x < N; x += x & -x) {
    c[x] ^= y;
  }
}

int query(int x) {
  int ret = 0;
  for (; x; x -= x & -x) {
    ret ^= c[x];
  }
  return ret;
}

int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    add(i + 1, x);
  }

  while (m--) {
    int op, x, y;
    cin >> op >> x >> y;
    if (op == 1) {
      add(x, y);
    } else {
      int ret = query(y) ^ query(x - 1);
      cout << ret << '\n';
    }
  }
  return 0;
}

Submission Info

Submission Time
Task F - Range Xor Query
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 600
Code Size 3108 Byte
Status AC
Exec Time 697 ms
Memory 4504 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All handmade_00.txt, handmade_01.txt, max_00.txt, max_01.txt, max_02.txt, max_03.txt, max_04.txt, max_05.txt, max_06.txt, max_07.txt, power_of_2_00.txt, power_of_2_01.txt, power_of_2_02.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
handmade_00.txt AC 10 ms 2872 KB
handmade_01.txt AC 2 ms 3044 KB
max_00.txt AC 685 ms 4276 KB
max_01.txt AC 687 ms 4268 KB
max_02.txt AC 665 ms 4336 KB
max_03.txt AC 643 ms 4500 KB
max_04.txt AC 697 ms 4504 KB
max_05.txt AC 690 ms 4496 KB
max_06.txt AC 678 ms 4328 KB
max_07.txt AC 651 ms 4276 KB
power_of_2_00.txt AC 572 ms 4220 KB
power_of_2_01.txt AC 577 ms 4084 KB
power_of_2_02.txt AC 575 ms 4148 KB
random_00.txt AC 495 ms 3428 KB
random_01.txt AC 443 ms 3900 KB
random_02.txt AC 111 ms 3056 KB
random_03.txt AC 519 ms 3916 KB
random_04.txt AC 65 ms 3112 KB
sample_01.txt AC 3 ms 3188 KB
sample_02.txt AC 2 ms 3232 KB