結果

問題 No.1641 Tree Xor Query
ユーザー keijakkeijak
提出日時 2021-08-06 22:04:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 87 ms / 5,000 ms
コード長 6,022 bytes
コンパイル時間 2,532 ms
コンパイル使用メモリ 212,928 KB
実行使用メモリ 17,852 KB
最終ジャッジ日時 2024-09-17 02:03:53
合計ジャッジ時間 3,764 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 3 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 87 ms
17,852 KB
testcase_14 AC 86 ms
17,852 KB
testcase_15 AC 4 ms
6,940 KB
testcase_16 AC 8 ms
6,940 KB
testcase_17 AC 5 ms
6,944 KB
testcase_18 AC 6 ms
6,940 KB
testcase_19 AC 3 ms
6,944 KB
testcase_20 AC 64 ms
13,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
  for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;

template<typename T, typename U>
inline bool chmax(T &a, U b) {
  return a < b and ((a = std::move(b)), true);
}
template<typename T, typename U>
inline bool chmin(T &a, U b) {
  return a > b and ((a = std::move(b)), true);
}
template<typename T>
inline int ssize(const T &a) {
  return (int) std::size(a);
}

template<typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (auto &x : a) is >> x;
  return is;
}
template<typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
  return os << "(" << a.first << ", " << a.second << ")";
}
template<typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
                        std::string_view ends = "\n",
                        std::ostream &os = std::cout) {
  auto b = std::begin(a), e = std::end(a);
  for (auto it = std::begin(a); it != e; ++it) {
    if (it != b) os << sep;
    os << *it;
  }
  return os << ends;
}
template<typename T, typename = void>
struct is_iterable : std::false_type {};
template<typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {
};

template<typename T, typename = std::enable_if_t<
    is_iterable<T>::value &&
        !std::is_same<T, std::string_view>::value &&
        !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
  return print_seq(a, ", ", "", (os << "{")) << "}";
}

void print() { std::cout << "\n"; }
template<class T>
void print(const T &x) {
  std::cout << x << "\n";
}
template<typename Head, typename... Tail>
void print(const Head &head, Tail... tail) {
  std::cout << head << " ";
  print(tail...);
}

void read_from_cin() {}
template<typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
  std::cin >> value;
  read_from_cin(args...);
}
#define INPUT(type, ...) \
  type __VA_ARGS__;      \
  read_from_cin(__VA_ARGS__)

#ifdef MY_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif

using namespace std;

vector<unsigned> cost;

struct EulerTour {
  using G = vector<vector<int>>;

  const int n;  // number of nodes
  const G &g;

  // Euler Tour on nodes.
  vector<int> in;   // index in the tour on entering the subtree of v
  vector<int> out;  // index in the tour on exiting the subtree of v
  vector<int> depth;
  vector<int> node_tour;
  vector<int> depth_tour;
  vector<unsigned> cost_tour;

  explicit EulerTour(const G &g, int root = 0)
      : n((int) g.size()), g(g), in(n, -1), out(n, -1), depth(n, -1) {
    node_tour.reserve(n * 2);
    depth_tour.reserve(n * 2);
    depth[root] = 0;
    dfs(root, -1);
  }

 private:
  void dfs(int v, int p) {
    in[v] = int(node_tour.size());
    if (p != -1) depth[v] = depth[p] + 1;
    node_tour.push_back(v);
    depth_tour.push_back(depth[v]);
    cost_tour.push_back(cost[v]);
    for (auto u : g[v]) {
      if (u == p) continue;
      dfs(u, v);
    }
    out[v] = int(node_tour.size());
  }
};

template<typename Monoid>
struct SegTree {
  using T = typename Monoid::T;

  int n_;                // number of valid leaves.
  int offset_;           // where leaves start
  std::vector<T> data_;  // data size: 2*offset_

  inline int size() const { return n_; }
  inline int offset() const { return offset_; }

  explicit SegTree(int n) : n_(n) {
    offset_ = 1;
    while (offset_ < n_) offset_ <<= 1;
    data_.assign(2 * offset_, Monoid::id());
  }

  explicit SegTree(const std::vector<T> &leaves) : n_(leaves.size()) {
    offset_ = 1;
    while (offset_ < n_) offset_ <<= 1;
    data_.assign(2 * offset_, Monoid::id());
    for (int i = 0; i < n_; ++i) {
      data_[offset_ + i] = leaves[i];
    }
    for (int i = offset_ - 1; i > 0; --i) {
      data_[i] = Monoid::op(data_[i * 2], data_[i * 2 + 1]);
    }
  }

  // Sets i-th value (0-indexed) to x.
  void set(int i, const T &x) {
    int k = offset_ + i;
    data_[k] = x;
    // Update its ancestors.
    while (k > 1) {
      k >>= 1;
      data_[k] = Monoid::op(data_[k * 2], data_[k * 2 + 1]);
    }
  }

  // Queries by [l,r) range (0-indexed, half-open interval).
  T fold(int l, int r) const {
    l = std::max(l, 0) + offset_;
    r = std::min(r, offset_) + offset_;
    T vleft = Monoid::id(), vright = Monoid::id();
    for (; l < r; l >>= 1, r >>= 1) {
      if (l & 1) vleft = Monoid::op(vleft, data_[l++]);
      if (r & 1) vright = Monoid::op(data_[--r], vright);
    }
    return Monoid::op(vleft, vright);
  }

  T fold_all() const { return data_[1]; }

  // Returns i-th value (0-indexed).
  T operator[](int i) const { return data_[offset_ + i]; }

  friend std::ostream &operator<<(std::ostream &os, const SegTree &st) {
    os << "[";
    for (int i = 0; i < st.size(); ++i) {
      if (i != 0) os << ", ";
      const auto &x = st[i];
      os << x;
    }
    return os << "]";
  }
};

struct XorOp {
  using T = unsigned;
  static T op(const T &x, const T &y) { return x ^ y; }
  static constexpr T id() { return 0; }
};

int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  cout << std::fixed << std::setprecision(15);

  INPUT(int, n, Q);
  cost.resize(n);
  cin >> cost;
  DUMP(cost);

  vector<vector<int>> g(n);
  REP(i, n - 1) {
    INPUT(int, a, b);
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  EulerTour et(g);
  DUMP(n, et.cost_tour.size());
  SegTree<XorOp> seg(et.cost_tour);

  REP(qi, Q) {
    DUMP(qi, seg);

    INPUT(unsigned, t, x, y);
    --x;
    if (t == 1) {
      int j = et.in[x];
      seg.set(j, seg[j] ^ y);
    } else {
      assert(y == 0);
      int l = et.in[x], r = et.out[x];
      auto ans = seg.fold(l, r);
      print(ans);
    }
  }

}
0