結果
問題 | No.1790 Subtree Deletion |
ユーザー |
|
提出日時 | 2021-12-19 10:37:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 182 ms / 3,000 ms |
コード長 | 19,208 bytes |
コンパイル時間 | 3,086 ms |
コンパイル使用メモリ | 274,792 KB |
最終ジャッジ日時 | 2025-01-27 03:39:02 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
/*** date : 2021-12-19 10:36:52*/#define NDEBUGusing namespace std;// intrinstic#include <immintrin.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <complex>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <typeinfo>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>// utilitynamespace Nyaan {using ll = long long;using i64 = long long;using u64 = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;template <typename T>using V = vector<T>;template <typename T>using VV = vector<vector<T>>;using vi = vector<int>;using vl = vector<long long>;using vd = V<double>;using vs = V<string>;using vvi = vector<vector<int>>;using vvl = vector<vector<long long>>;template <typename T, typename U>struct P : pair<T, U> {template <typename... Args>P(Args... args) : pair<T, U>(args...) {}using pair<T, U>::first;using pair<T, U>::second;T &x() { return first; }const T &x() const { return first; }U &y() { return second; }const U &y() const { return second; }P &operator+=(const P &r) {first += r.first;second += r.second;return *this;}P &operator-=(const P &r) {first -= r.first;second -= r.second;return *this;}P &operator*=(const P &r) {first *= r.first;second *= r.second;return *this;}P operator+(const P &r) const { return P(*this) += r; }P operator-(const P &r) const { return P(*this) -= r; }P operator*(const P &r) const { return P(*this) *= r; }P operator*(int r) const { return {first * r, second * r}; }P operator-() const { return P{-first, -second}; }};using pl = P<ll, ll>;using pi = P<int, int>;using vp = V<pl>;constexpr int inf = 1001001001;constexpr long long infLL = 4004004004004004004LL;template <typename T>int sz(const T &t) {return t.size();}template <typename T, typename U>inline bool amin(T &x, U y) {return (y < x) ? (x = y, true) : false;}template <typename T, typename U>inline bool amax(T &x, U y) {return (x < y) ? (x = y, true) : false;}template <typename T>inline T Max(const vector<T> &v) {return *max_element(begin(v), end(v));}template <typename T>inline T Min(const vector<T> &v) {return *min_element(begin(v), end(v));}template <typename T>inline long long Sum(const vector<T> &v) {return accumulate(begin(v), end(v), 0LL);}template <typename T>int lb(const vector<T> &v, const T &a) {return lower_bound(begin(v), end(v), a) - begin(v);}template <typename T>int ub(const vector<T> &v, const T &a) {return upper_bound(begin(v), end(v), a) - begin(v);}constexpr long long TEN(int n) {long long ret = 1, x = 10;for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);return ret;}template <typename T, typename U>pair<T, U> mkp(const T &t, const U &u) {return make_pair(t, u);}template <typename T>vector<T> mkrui(const vector<T> &v, bool rev = false) {vector<T> ret(v.size() + 1);if (rev) {for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];} else {for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];}return ret;};template <typename T>vector<T> mkuni(const vector<T> &v) {vector<T> ret(v);sort(ret.begin(), ret.end());ret.erase(unique(ret.begin(), ret.end()), ret.end());return ret;}template <typename F>vector<int> mkord(int N, F f) {vector<int> ord(N);iota(begin(ord), end(ord), 0);sort(begin(ord), end(ord), f);return ord;}template <typename T>vector<int> mkinv(vector<T> &v) {int max_val = *max_element(begin(v), end(v));vector<int> inv(max_val + 1, -1);for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;return inv;}} // namespace Nyaan// bit operationnamespace Nyaan {__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {return _mm_popcnt_u64(a);}inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }template <typename T>inline int gbit(const T &a, int i) {return (a >> i) & 1;}template <typename T>inline void sbit(T &a, int i, bool b) {if (gbit(a, i) != b) a ^= T(1) << i;}constexpr long long PW(int n) { return 1LL << n; }constexpr long long MSK(int n) { return (1LL << n) - 1; }} // namespace Nyaan// inoutnamespace Nyaan {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &... u) {cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &... u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template <typename T, class... U, char sep = ' '>void outr(const T &t, const U &... u) {cout << t;outr(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} // namespace Nyaan// debugnamespace DebugImpl {template <typename U, typename = void>struct is_specialize : false_type {};template <typename U>struct is_specialize<U, typename conditional<false, typename U::iterator, void>::type>: true_type {};template <typename U>struct is_specialize<U, typename conditional<false, decltype(U::first), void>::type>: true_type {};template <typename U>struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {};void dump(const char& t) { cerr << t; }void dump(const string& t) { cerr << t; }void dump(const bool& t) { cerr << (t ? "true" : "false"); }template <typename U,enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>void dump(const U& t) {cerr << t;}template <typename T>void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {string res;if (t == Nyaan::inf) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::inf) res = "-inf";}if constexpr (sizeof(T) == 8) {if (t == Nyaan::infLL) res = "inf";if constexpr (is_signed<T>::value) {if (t == -Nyaan::infLL) res = "-inf";}}if (res.empty()) res = to_string(t);cerr << res;}template <typename T, typename U>void dump(const pair<T, U>&);template <typename T>void dump(const pair<T*, int>&);template <typename T>void dump(const T& t,enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {cerr << "[ ";for (auto it = t.begin(); it != t.end();) {dump(*it);cerr << (++it == t.end() ? "" : ", ");}cerr << " ]";}template <typename T, typename U>void dump(const pair<T, U>& t) {cerr << "( ";dump(t.first);cerr << ", ";dump(t.second);cerr << " )";}template <typename T>void dump(const pair<T*, int>& t) {cerr << "[ ";for (int i = 0; i < t.second; i++) {dump(t.first[i]);cerr << (i == t.second - 1 ? "" : ", ");}cerr << " ]";}void trace() { cerr << endl; }template <typename Head, typename... Tail>void trace(Head&& head, Tail&&... tail) {cerr << " ";dump(head);if (sizeof...(tail) != 0) cerr << ",";trace(forward<Tail>(tail)...);}} // namespace DebugImpl#ifdef NyaanDebug#define trc(...) \do { \cerr << "## " << #__VA_ARGS__ << " = "; \DebugImpl::trace(__VA_ARGS__); \} while (0)#else#define trc(...) (void(0))#endif// macro#define each(x, v) for (auto&& x : v)#define each2(x, y, v) for (auto&& [x, y] : v)#define all(v) (v).begin(), (v).end()#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)#define reg(i, a, b) for (long long i = (a); i < (b); i++)#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)#define fi first#define se second#define ini(...) \int __VA_ARGS__; \in(__VA_ARGS__)#define inl(...) \long long __VA_ARGS__; \in(__VA_ARGS__)#define ins(...) \string __VA_ARGS__; \in(__VA_ARGS__)#define in2(s, t) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i]); \}#define in3(s, t, u) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i]); \}#define in4(s, t, u, v) \for (int i = 0; i < (int)s.size(); i++) { \in(s[i], t[i], u[i], v[i]); \}#define die(...) \do { \Nyaan::out(__VA_ARGS__); \return; \} while (0)namespace Nyaan {void solve();}int main() { Nyaan::solve(); }//template <typename T>struct edge {int src, to;T cost;edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T>using Edges = vector<edge<T>>;template <typename T>using WeightedGraph = vector<Edges<T>>;using UnweightedGraph = vector<vector<int>>;// Input of (Unweighted) GraphUnweightedGraph graph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {UnweightedGraph g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;if (is_1origin) x--, y--;g[x].push_back(y);if (!is_directed) g[y].push_back(x);}return g;}// Input of Weighted Graphtemplate <typename T>WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,bool is_1origin = true) {WeightedGraph<T> g(N);if (M == -1) M = N - 1;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;cin >> c;if (is_1origin) x--, y--;g[x].emplace_back(x, y, c);if (!is_directed) g[y].emplace_back(y, x, c);}return g;}// Input of Edgestemplate <typename T>Edges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {Edges<T> es;for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;es.emplace_back(x, y, c);}return es;}// Input of Adjacency Matrixtemplate <typename T>vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,bool is_directed = false, bool is_1origin = true) {vector<vector<T>> d(N, vector<T>(N, INF));for (int _ = 0; _ < M; _++) {int x, y;cin >> x >> y;T c;if (is_weighted)cin >> c;elsec = 1;if (is_1origin) x--, y--;d[x][y] = c;if (!is_directed) d[y][x] = c;}return d;}/*** @brief グラフテンプレート* @docs docs/graph/graph-template.md*/// LazySegmentTreetemplate <typename T, typename E, typename F, typename G, typename H>struct LazySegmentTree {int n, height;F f;G g;H h;T ti;E ei;vector<T> dat;vector<E> laz;LazySegmentTree(int _n, F _f, G _g, H _h, T _ti, E _ei): f(_f), g(_g), h(_h), ti(_ti), ei(_ei) {init(_n);}LazySegmentTree(const vector<T> &v, F _f, G _g, H _h, T _ti, E _ei): f(_f), g(_g), h(_h), ti(_ti), ei(_ei) {init((int)v.size());build(v);}void init(int _n) {n = 1;height = 0;while (n < _n) n <<= 1, height++;dat.assign(2 * n, ti);laz.assign(2 * n, ei);}void build(const vector<T> &v) {int _n = v.size();init(_n);for (int i = 0; i < _n; i++) dat[n + i] = v[i];for (int i = n - 1; i; i--)dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);}inline T reflect(int k) { return laz[k] == ei ? dat[k] : g(dat[k], laz[k]); }inline void eval(int k) {if (laz[k] == ei) return;laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);dat[k] = reflect(k);laz[k] = ei;}inline void thrust(int k) {for (int i = height; i; i--) eval(k >> i);}inline void recalc(int k) {while (k >>= 1) dat[k] = f(reflect((k << 1) | 0), reflect((k << 1) | 1));}void update(int a, int b, E x) {if (a >= b) return;thrust(a += n);thrust(b += n - 1);for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {if (l & 1) laz[l] = h(laz[l], x), l++;if (r & 1) --r, laz[r] = h(laz[r], x);}recalc(a);recalc(b);}void set_val(int a, T x) {thrust(a += n);dat[a] = x;laz[a] = ei;recalc(a);}T get_val(int a) {thrust(a += n);return reflect(a);}T query(int a, int b) {if (a >= b) return ti;thrust(a += n);thrust(b += n - 1);T vl = ti, vr = ti;for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {if (l & 1) vl = f(vl, reflect(l++));if (r & 1) vr = f(reflect(--r), vr);}return f(vl, vr);}};template <typename T>struct has_cost {private:template <typename U>static auto confirm(U u) -> decltype(u.cost, std::true_type());static auto confirm(...) -> std::false_type;public:enum : bool { value = decltype(confirm(std::declval<T>()))::value };};template <typename T>vector<vector<T>> inverse_tree(const vector<vector<T>>& g) {int N = (int)g.size();vector<vector<T>> rg(N);for (int i = 0; i < N; i++) {for (auto& e : g[i]) {if constexpr (is_same<T, int>::value) {rg[e].push_back(i);} else if constexpr (has_cost<T>::value) {rg[e].emplace_back(e.to, i, e.cost);} else {assert(0);}}}return rg;}template <typename T>vector<vector<T>> rooted_tree(const vector<vector<T>>& g, int root = 0) {int N = (int)g.size();vector<vector<T>> rg(N);vector<char> v(N, false);v[root] = true;queue<int> que;que.emplace(root);while (!que.empty()) {auto p = que.front();que.pop();for (auto& e : g[p]) {if (v[e] == false) {v[e] = true;que.push(e);rg[p].push_back(e);}}}return rg;}/*** @brief 根付き木・逆辺からなる木への変換*/template <typename G>struct HeavyLightDecomposition {private:void dfs_sz(int cur) {size[cur] = 1;for (auto& dst : g[cur]) {if (dst == par[cur]) {if (g[cur].size() >= 2 && int(dst) == int(g[cur][0]))swap(g[cur][0], g[cur][1]);elsecontinue;}depth[dst] = depth[cur] + 1;par[dst] = cur;dfs_sz(dst);size[cur] += size[dst];if (size[dst] > size[g[cur][0]]) {swap(dst, g[cur][0]);}}}void dfs_hld(int cur) {down[cur] = id++;for (auto dst : g[cur]) {if (dst == par[cur]) continue;nxt[dst] = (int(dst) == int(g[cur][0]) ? nxt[cur] : int(dst));dfs_hld(dst);}up[cur] = id;}// [u, v)vector<pair<int, int>> ascend(int u, int v) const {vector<pair<int, int>> res;while (nxt[u] != nxt[v]) {res.emplace_back(down[u], down[nxt[u]]);u = par[nxt[u]];}if (u != v) res.emplace_back(down[u], down[v] + 1);return res;}// (u, v]vector<pair<int, int>> descend(int u, int v) const {if (u == v) return {};if (nxt[u] == nxt[v]) return {{down[u] + 1, down[v]}};auto res = descend(u, par[nxt[v]]);res.emplace_back(down[nxt[v]], down[v]);return res;}public:G& g;int id;vector<int> size, depth, down, up, nxt, par;HeavyLightDecomposition(G& _g, int root = 0): g(_g),id(0),size(g.size(), 0),depth(g.size(), 0),down(g.size(), -1),up(g.size(), -1),nxt(g.size(), root),par(g.size(), root) {dfs_sz(root);dfs_hld(root);}void build(int root) {dfs_sz(root);dfs_hld(root);}pair<int, int> idx(int i) const { return make_pair(down[i], up[i]); }template <typename F>void path_query(int u, int v, bool vertex, const F& f) {int l = lca(u, v);for (auto&& [a, b] : ascend(u, l)) {int s = a + 1, t = b;s > t ? f(t, s) : f(s, t);}if (vertex) f(down[l], down[l] + 1);for (auto&& [a, b] : descend(l, v)) {int s = a, t = b + 1;s > t ? f(t, s) : f(s, t);}}template <typename F>void path_noncommutative_query(int u, int v, bool vertex, const F& f) {int l = lca(u, v);for (auto&& [a, b] : ascend(u, l)) f(a + 1, b);if (vertex) f(down[l], down[l] + 1);for (auto&& [a, b] : descend(l, v)) f(a, b + 1);}template <typename F>void subtree_query(int u, bool vertex, const F& f) {f(down[u] + int(!vertex), up[u]);}int lca(int a, int b) {while (nxt[a] != nxt[b]) {if (down[a] < down[b]) swap(a, b);a = par[nxt[a]];}return depth[a] < depth[b] ? a : b;}int dist(int a, int b) { return depth[a] + depth[b] - depth[lca(a, b)] * 2; }};/*** @brief Heavy Light Decomposition(重軽分解)* @docs docs/tree/heavy-light-decomposition.md*/using namespace Nyaan;void Nyaan::solve() {inl(N);auto g = wgraph<ll>(N);g = rooted_tree(g);HeavyLightDecomposition hld(g);LazySegmentTree seg(vl(N), [](ll a, ll b) { return a ^ b; }, [](ll a, ll b) { return a & b; },[](ll a, ll b) { return a & b; }, 0LL, MSK(60));rep(i, N) each(e, g[i]) { seg.set_val(hld.down[e], e.cost); }ini(Q);rep(i, Q) {ini(t, x);--x;auto [d, u] = hld.idx(x);if (t == 1) {seg.update(d, u, 0);} else {out(seg.query(d + 1, u));}rep(i,N)trc(i,seg.get_val(hld.down[i]));}}