結果
| 問題 | No.1790 Subtree Deletion |
| ユーザー |
👑  rin204
|
| 提出日時 | 2023-02-03 15:02:24 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 178 ms / 3,000 ms |
| コード長 | 12,994 bytes |
| コンパイル時間 | 2,703 ms |
| コンパイル使用メモリ | 235,708 KB |
| 実行使用メモリ | 22,872 KB |
| 最終ジャッジ日時 | 2024-07-02 14:27:33 |
| 合計ジャッジ時間 | 7,385 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 150 ms
22,872 KB |
| testcase_04 | AC | 178 ms
22,744 KB |
| testcase_05 | AC | 166 ms
22,748 KB |
| testcase_06 | AC | 152 ms
22,740 KB |
| testcase_07 | AC | 148 ms
22,744 KB |
| testcase_08 | AC | 17 ms
5,376 KB |
| testcase_09 | AC | 148 ms
22,744 KB |
| testcase_10 | AC | 153 ms
22,872 KB |
| testcase_11 | AC | 174 ms
22,700 KB |
| testcase_12 | AC | 124 ms
21,684 KB |
| testcase_13 | AC | 115 ms
19,124 KB |
| testcase_14 | AC | 38 ms
7,552 KB |
ソースコード
#line 1 "A.cpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
#define endl "\n"
#define spa ' '
#define len(A) A.size()
#define all(A) begin(A), end(A)
#define fori1(a) for(ll _ = 0; _ < (a); _++)
#define fori2(i, a) for(ll i = 0; i < (a); i++)
#define fori3(i, a, b) for(ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for(ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
template <typename T>
vector<tuple<ll, T>> ENUMERATE(vector<T> &A, ll s = 0){
vector<tuple<ll, T>> ret(A.size());
for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]};
return ret;
}
vector<tuple<ll, char>> ENUMERATE(string &A, ll s = 0){
vector<tuple<ll, char>> ret(A.size());
for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]};
return ret;
}
#define enum1(A) fori(A.size())
#define enum2(a, A) for(auto a:A)
#define enum3(i, a, A) for(auto&& [i, a]: ENUMERATE(A))
#define enum4(i, a, A, s) for(auto&& [i, a]: ENUMERATE(A, s))
#define enum(...) overload4(__VA_ARGS__, enum4, enum3, enum2, enum1)(__VA_ARGS__)
template <typename T, typename S>
vector<tuple<T, S>> ZIP(vector<T> &A, vector<S> &B){
int n = min(A.size(), B.size());
vector<tuple<T, S>> ret(n);
for(int i = 0; i < n; i++) ret[i] = {A[i], B[i]};
return ret;
}
template <typename T, typename S>
vector<tuple<ll, T, S>> ENUMZIP(vector<T> &A, vector<S> &B, ll s = 0){
int n = min(A.size(), B.size());
vector<tuple<ll, T, S>> ret(n);
for(int i = 0; i < n; i++) ret[i] = {i + s, A[i], B[i]};
return ret;
}
#define zip4(a, b, A, B) for(auto&& [a, b]: ZIP(A, B))
#define enumzip5(i, a, b, A, B) for(auto&& [i, a, b]: ENUMZIP(A, B))
#define enumzip6(i, a, b, A, B, s) for(auto&& [i, a, b]: ENUMZIP(A, B, s))
#define overload6(a, b, c, d, e, f, g, ...) g
#define zip(...) overload6(__VA_ARGS__, enumzip6, enumzip5, zip4, _, _, _)(__VA_ARGS__)
vector<char> stoc(string &S){
int n = S.size();
vector<char> ret(n);
for(int i = 0; i < n; i++) ret[i] = S[i];
return ret;
}
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;
template<class T> auto min(const T& a){
return *min_element(all(a));
}
template<class T> auto max(const T& a){
return *max_element(all(a));
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
void FLUSH(){cout << flush;}
void print(){cout << endl;}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(Tail)) cout << spa;
print(forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> &A){
int n = A.size();
for(int i = 0; i < n; i++){
cout << A[i];
if(i == n - 1) cout << endl;
else cout << spa;
}
}
template<typename T>
void print(vector<vector<T>> &A){
for(auto &row: A) print(row);
}
template<typename T, typename S>
void print(pair<T, S> &A){
cout << A.first << spa << A.second << endl;
}
template<typename T, typename S>
void print(vector<pair<T, S>> &A){
for(auto &row: A) print(row);
}
template<typename T, typename S>
void prisep(vector<T> &A, S sep){
int n = A.size();
for(int i = 0; i < n; i++){
cout << A[i];
if(i == n - 1) cout << endl;
else cout << sep;
}
}
template<typename T, typename S>
void priend(T A, S end){
cout << A << end;
}
template<typename T>
void priend(T A){
priend(A, spa);
}
template<class... T>
void inp(T&... a){
(cin >> ... >> a);
}
template<typename T>
void inp(vector<T> &A){
for(auto &a:A) cin >> a;
}
template<typename T>
void inp(vector<vector<T>> &A){
for(auto &row:A) inp(row);
}
template<typename T, typename S>
void inp(pair<T, S> &A){
inp(A.first, A.second);
}
template<typename T, typename S>
void inp(vector<pair<T, S>> &A){
for(auto &row: A) inp(row.first, row.second);
}
template<typename T>
T sum(vector<T> &A){
T tot = 0;
for(auto a:A) tot += a;
return tot;
}
template<typename T>
pair<vector<T>, map<T, int>> compression(vector<T> X){
sort(all(X));
X.erase(unique(all(X)), X.end());
map<T, int> mp;
for(int i = 0; i < X.size(); i++) mp[X[i]] = i;
return {X, mp};
}
#line 2 "Library/C++/data_structure/lazySegTree.hpp"
template<class S, S(*op)(S, S), S(*e)(), class F,
S (*mapping)(F, S), F(*composition)(F, F), F(*id)()>
struct lazy_segtree{
public:
lazy_segtree(vector<S> &v) : _n(int(v.size())){
size = 1;
log = 0;
while(size < _n){
log++;
size <<= 1;
}
d = vector<S>(2 * size, e());
lz = vector<F>(size, id());
for(int i = 0; i < _n; i++) d[size + i] = v[i];
for(int i = size - 1; i >= 1; i--) update(i);
}
lazy_segtree(int n): lazy_segtree(vector<S>(n, e())){};
S prod(int l, int r){
if(l == r) return e();
l += size;
r += size;
for(int i = log; i >= 1; i--){
if(((l >> i) << i) != l) push(l >> i);
if(((r >> i) << i) != r) push((r - 1) >> i);
}
S sml = e(), smr = e();
while(l < r){
if(l & 1) sml = op(sml, d[l++]);
if(r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() {
return d[1];
}
void apply(int l, int r, F f){
if(l == r) return;
l += size;
r += size;
for(int i = log; i >= 1; i--){
if(((l >> i) << i) != l) push(l >> i);
if(((r >> i) << i) != r) push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while(l < r){
if(l & 1) all_apply(l++, f);
if(r & 1) all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for(int i = 1; i <= log; i++){
if(((l >> i) << i) != l) update(l >> i);
if(((r >> i) << i) != r) update((r - 1) >> i);
}
}
private:
int _n, size, log;
vector<S> d;
vector<F> lz;
void update(int k){
d[k] = op(d[2 * k], d[2 * k + 1]);
}
void all_apply(int k, F f){
d[k] = mapping(f, d[k]);
if(k < size) lz[k] = composition(f, lz[k]);
}
void push(int k){
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
#line 2 "Library/C++/tree/HLD.hpp"
struct HLD{
int n, path;
vector<vector<int>> edges;
vector<int> siz;
vector<int> par;
vector<int> dist;
vector<int> path_ind;
vector<int> path_root;
vector<int> heavy_child;
vector<bool> isheavy;
vector<int> L;
vector<int> R;
HLD(int n) : n(n){
edges.resize(n);
siz.assign(n, -1);
par.assign(n, -1);
dist.assign(n, -1);
path_ind.assign(n, -1);
heavy_child.assign(n, -1);
isheavy.assign(n, false);
L.assign(n, -1);
R.assign(n, -1);
}
void read_edges(int indexed=1){
int u, v;
for(int i = 0; i < n - 1; i++){
cin >> u >> v;
u -= indexed;
v -= indexed;
edges[u].push_back(v);
edges[v].push_back(u);
}
}
void add_edge(int u, int v){
edges[u].push_back(v);
edges[v].push_back(u);
}
void build(){
dist[0] = 0;
stack<int> st;
vector<int> route;
st.push(0);
route.push_back(0);
while(!st.empty()){
int pos = st.top();
st.pop();
for(auto npos:edges[pos]){
if(dist[npos] == -1){
dist[npos] = dist[pos] + 1;
par[npos] = pos;
st.push(npos);
route.push_back(npos);
}
}
}
reverse(route.begin(), route.end());
for(auto pos: route){
siz[pos] = 1;
int ma = -1;
for(auto npos: edges[pos]){
if(dist[npos] > dist[pos]) siz[pos] += siz[npos];
if(siz[npos] > ma){
ma = siz[npos];
heavy_child[pos] = npos;
}
}
if(heavy_child[pos] != -1) isheavy[heavy_child[pos]] = true;
}
isheavy[0] = true;
path = 0;
st.push(~0);
st.push(0);
path_root.push_back(0);
int cc = 0;
while(!st.empty()){
int pos = st.top();
st.pop();
if(pos >= 0){
L[pos] = cc++;
if(!isheavy[pos]){
path++;
path_root.push_back(pos);
}
path_ind[pos] = path;
for(auto npos: edges[pos]){
if(npos == par[pos] || npos == heavy_child[pos]) continue;
st.push(~npos);
st.push(npos);
}
if(heavy_child[pos] != -1){
int npos = heavy_child[pos];
st.push(~npos);
st.push(npos);
}
}
else{
pos = ~pos;
R[pos] = cc;
}
}
}
vector<pair<int, int>> get_path(int u, int v){
vector<int> ll;
vector<int> rr;
ll.push_back(u);
rr.push_back(v);
while(path_ind[u] != path_ind[v]){
if(dist[path_root[path_ind[u]]] >= dist[path_root[path_ind[v]]]){
u = path_root[path_ind[u]];
ll.push_back(u);
u = par[u];
ll.push_back(u);
}
else{
v = path_root[path_ind[v]];
rr.push_back(v);
v = par[v];
rr.push_back(v);
}
}
reverse(rr.begin(), rr.end());
ll.insert(ll.end(), rr.begin(), rr.end());
int n = ll.size();
vector<pair<int, int>> res(n / 2);
for(int i = 0; i < n; i += 2){
res[i / 2] = {ll[i], ll[i + 1]};
}
return res;
}
};
#line 187 "A.cpp"
using S = ll;
S op(S l, S r){
return l ^ r;
}
S e(){
return 0LL;
}
using F = int;
S mapping(F f, S x){
if(f == 0) return x;
else return 0;
}
F composition(F f, F g){
return f | g;
}
F id(){
return 0;
}
void solve(){
INT(n);
using P = pair<int, ll>;
vvec(P, edges, n);
HLD hld(n);
fori(n - 1){
INT(u, v);
LL(a);
u--; v--;
edges[u].push_back({v, a});
edges[v].push_back({u, a});
hld.add_edge(u, v);
}
hld.build();
vec(bool, used, n, false);
vec(ll, A, n);
A[hld.L[0]] = 0;
stack<int> st;
st.push(0);
used[0] = true;
while(!st.empty()){
int pos = st.top(); st.pop();
for(auto tmp:edges[pos]){
int npos = tmp.first;
ll a = tmp.second;
if(!used[npos]){
used[npos] = true;
A[hld.L[npos]] = a;
st.push(npos);
}
}
}
lazy_segtree<S, op, e, F, mapping, composition, id> seg(A);
INT(Q);
fori(Q){
INT(t, x);
x--;
if(t == 1){
seg.apply(hld.L[x], hld.R[x], 1);
}
else{
ll ans = seg.prod(hld.L[x] + 1, hld.R[x]);
print(ans);
}
}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
// cout << fixed << setprecision(12);
int t;
t = 1;
// cin >> t;
while(t--) solve();
return 0;
}