树链剖分+树状数组：ABC 460 G

本文搬运自本人高中时期CSDN博客，若图片加载不出来，可到原文查看：https://blog.csdn.net/zhangtingxiqwq/article/details/162444175

https://atcoder.jp/contests/abc460/tasks/abc460_g

考虑直接树剖

单点权重修改是容易的

单点颜色修改，往上更新是容易的，但往下合并不容易，把下方值往上传亦不容易

但如果往下合并的值提前记录好了呢？

我们可以多定义一个 懒标记 ，代表这个点所有与它本身颜色不同子节点的值的和

利用这个懒标记，我们即可实现颜色翻转时子节点信息的向上传递。

这个懒标记的维护，只需要我们每次往上修改时，先修改完所有同颜色的，然后再修改第一个不同颜色的即可

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
 #define debug(...) fprintf(stdout, ##__VA_ARGS__)
#else
 #define debug(...) void(0)
#endif
#define int long long
inline int read(){int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;
ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+
(x<<3)+(ch^48);ch=getchar();}return x*f;}
#define Z(x) (x)*(x)
#define pb push_back
#define fi first
#define se second
//#define M
//#define mo
#define N 300010
int n, m, i, j, k, T;
int c[N]; 
int tot; 
vector<int>G[N]; 

namespace Bin {
	int S[2][N]; 
	void add(int l, int r, int x, int co) {
		auto Add = [&] (int x, int k, int co) {
			if(!x) return ; 
			while(x <= tot) {
				S[co][x] += k; 
				x += x & -x; 
			}
		}; 
		debug("ADD [%lld %lld] + %lld of (%lld)\n", l, r, x, co); 
		Add(l, x, co); Add(r + 1, -x, co); 
	} 
	int qry(int x, int co) {
		int ans = 0; 
		while(x) {
			ans += S[co][x]; 
			x -= x & -x; 
		}
		return ans; 
	}
}

namespace BinC {
	int S[N]; 
	void Add(int x, int k) {
		if(!x) return ; 
//		debug("BinCCCCCC %lld + %lld\n", x, k); 
		while(x <= tot) {
			S[x] += k; 
			x += x & -x; 
		}
	}
	int qry(int l, int r) {
		auto Qry = [&] (int x) -> int {
			int ans = 0; 
			while(x) {
				ans += S[x]; 
				x -= x & -x; 
			}
			return ans; 
		}; 
		return Qry(r) - Qry(l - 1); 
	}
	bool check(int l, int r) {
		int ans = qry(l, r); 
//		debug("Ans of [%lld %lld] is %lld\n", l, r, ans); 
		if(ans == 0 || ans == r - l + 1) return true; 
		return false; 
	}
}

namespace Tree {
	int w[N], F[N], son[N], a[N], dfn[N]; 
	int top[N]; 
	void dfs1(int x, int fa) {
		w[x] = 1; F[x] = fa; 
		for(int y : G[x])
			if(y != fa) {
				dfs1(y, x); 
				w[x] += w[y]; 
				if(!son[x] || w[y] > w[son[x]]) 
					son[x] = y; 
			}
	}
	void dfs2(int x, int fa) {
		dfn[x] = ++tot; a[tot] = x; 
		if(son[x]) top[son[x]] = top[x], dfs2(son[x], x); 
		for(int y : G[x]) 
			if(y != fa && y != son[x]) {
				top[y] = y; 
				dfs2(y, x); 
			}
//		debug("top[%lld] = %lld\n", x, top[x]); 
	}
	int Fa(int x) {
		if(!BinC :: check(dfn[top[x]], dfn[x])) {
			int l, r, mid; 
			l = dfn[top[x]]; r = dfn[x]; 
			while(l < r) {
				mid = (l + r) >> 1; 
				if(BinC :: check(mid, dfn[x])) r = mid; 
				else l = mid + 1; 
			}
			return a[l]; 
		}
		if(c[F[top[x]]] == c[x]) return Fa(F[top[x]]); 
		else return top[x]; 
	}
	void add(int x, int k, int col) {
		debug("Tree add %lld [%lld] %lld\n", x, k, col); 
		if(c[x] != col) return ; 
		if(!BinC :: check(dfn[top[x]], dfn[x])) {
			int l, r, mid; 
			l = mid = dfn[top[x]]; r = dfn[x]; 
			while(l < r) {
				mid = (l + r) >> 1; 
				if(BinC :: check(mid, dfn[x])) r = mid; 
				else l = mid + 1; 
			}
//			debug("Now [%lld %lld] %lld %lld\n", dfn[top[x]], dfn[x], mid, (int)BinC :: check(mid, dfn[x])); 
			Bin :: add(l, dfn[x], k, col); 
			Bin :: add(l - 1, l - 1, k, col); 
		}
		else {
			Bin :: add(dfn[top[x]], dfn[x], k, col); 
			if(c[F[top[x]]] == c[x]) add(F[top[x]], k, col); 
			else Bin :: add(dfn[F[top[x]]], dfn[F[top[x]]], k, col); 
		}
	}
	void op2(int x, int k) {
		debug("OP2 %lld(%lld) += %lld\n", x, Fa(x), k); 
		add(x, k, c[x]); 
		Bin :: add(dfn[x], dfn[x], k, 1 - c[x]); 
	}
	int op3(int x) {
		int pare = Fa(x); 
		debug("OP3 %lld : %lld == %lld\n", x, pare, Bin :: qry(dfn[pare], c[x])); 
		return Bin :: qry(dfn[pare], c[x]); 
	}
	void op1(int x) {
		int k = Bin :: qry(dfn[x], c[x]); 
		if(c[F[x]] == c[x]) add(F[x], -k, c[x]); 
		else Bin :: add(dfn[F[x]], dfn[F[x]], -k, c[x]); 
		BinC :: Add(dfn[x], - c[x] + (1 - c[x])); 
		c[x] = 1 - c[x]; 
		k = Bin :: qry(dfn[x], c[x]); 
		if(c[F[x]] == c[x]) add(F[x], k, c[x]); 
		else Bin :: add(dfn[F[x]], dfn[F[x]], k, c[x]);  
	}
}

signed main()
{
	#ifdef LOCAL
	  freopen("in.txt", "r", stdin);
	  freopen("out.txt", "w", stdout);
	#endif
//	srand(time(NULL));
//	T = read();
//	while(T--) {
//
//	}
	int q, u, v; 
	n = read(); q = read(); 
	vector<int>w(n + 10); 
	for(i = 1; i <= n; ++i) w[i] = read(); 
	for(i = 1; i <= n; ++i) c[i] = read(); 
	c[0] = n << 2; G[0].pb(1); 
	for(i = 1; i < n; ++i) {
		u = read(); v = read(); 
		G[u].pb(v); G[v].pb(u); 
	}
	Tree :: dfs1(0, 0); 
	Tree :: dfs2(0, 0); 
//	for(i = 1; i <= tot; ++i) debug("%lld ", Tree :: a[i]); debug("\n"); 
	for(i = 0; i <= n; ++i) BinC :: Add(Tree :: dfn[i], c[i]); 
	for(i = 1; i <= n; ++i) Tree :: op2(i, w[i]); 
	while(q--) {
		int op, x; 
		op = read(); x = read(); 
		if(op == 1) Tree :: op1(x); 
		if(op == 2) {
			k = read(); 
			Tree :: op2(x, k); 
		}
		if(op == 3) {
			printf("%lld\n", Tree :: op3(x)); 
		}
		for(i = 1; i <= n; ++i) debug("%lld ", Bin :: qry(Tree :: dfn[i], 0)); debug("\n"); 
		for(i = 1; i <= n; ++i) debug("%lld ", Bin :: qry(Tree :: dfn[i], 1)); debug("\n"); 
		debug("-------------------------------\n"); 
	}
	return 0;
}