题解
版本1:树链剖分+线段树
参考大佬
题意:
给出一颗树,每个点都有权值,有四个操作:
- 1.把 (u,v) 路径上所有的点的权值改为 w
- 2.把 (u,v) 路径上所有的点的权值加上 w
- 3.把 (u,v) 路径上所有的点的权值乘上 w
- 4.求 (u,v) 路径上所有点权的立方和
以上四个操作均可看成 w ′ ∗ x + y w'*x+y w′∗x+y 的形式:
- 1. w ′ ∗ 0 + w w'*0+w w′∗0+w
- 2. w ′ ∗ 1 + w w'*1+w w′∗1+w
- 3. w ′ ∗ w + 0 w'*w+0 w′∗w+0.
这样一来,三个操作可以用同一个update()
函数更新,
用两个懒标记Add[],Mul[]
加以优化
而对于操作4求立方和,涉及线段树的区间的操作,如何用懒标记更改长度超过1的区间的呢?
假设原区间立方和 = w 1 3 + w 2 3 + w 3 3 =w_1^3+w_2^3+w_3^3 =w13+w23+w33,记为sum3
经过一系列操作后 现区间立方和变为
( w 1 ∗ x + y ) 3 + ( w 2 ∗ x + y ) 3 + ( w 3 ∗ x + y ) 3 (w_1*x+y)^3+(w_2*x+y)^3+(w_3*x+y)^3 (w1∗x+y)3+(w2∗x+y)3+(w3∗x+y)3
= ( x 3 w 1 3 + 3 x 2 w 1 2 y + 3 x w 1 y 2 + y 3 ) + ( x 3 w 2 3 + 3 x 2 w 2 2 y + 3 x w 2 y 2 + y 3 ) + ( x 3 w 3 3 + 3 x 2 w 3 2 y + 3 x w 3 y 2 + y 3 ) =(x^3w_1^3+3x^2w_1^2y+3xw_1y^2+y^3)+(x^3w_2^3+3x^2w_2^2y+3xw_2y^2+y^3)+(x^3w_3^3+3x^2w_3^2y+3xw_3y^2+y^3) =(x3w13+3x2w12y+3xw1y2+y3)+(x3w23+3x2w22y+3xw2y2+y3)+(x3w33+3x2w32y+3xw3y2+y3)
= x 3 ( w 1 3 + w 2 3 + w 3 3 ) + 3 x 2 y ( w 1 2 + w 2 2 + w 3 2 ) + 3 x y 2 ( w 1 + w 2 + w 3 ) + 3 y 3 =x^3(w_1^3+w_2^3+w_3^3)+3x^2y(w1^2+w2^2+w3^2)+3xy^2(w1+w2+w3)+3y^3 =x3(w13+w23+w33)+3x2y(w12+w22+w32)+3xy2(w1+w2+w3)+3y3
可以看到其中出现了 区间和 和 区间立方和 ,分别记作sum、sum2,
按照这个公式推导到区间长度为n的区间内,和、平方和、立方和分别维护:
s u m 3 n e w = x 3 s u m 3 o l d + 3 x 2 y ∗ s u m 2 o l d + 3 x y 2 ∗ s u m o l d + n y 3 sum3_{new}=x^3sum3_{old}+3x^2y*sum2_{old}+3xy^2*sum_{old}+ny^3 sum3new=x3sum3old+3x2y∗sum2old+3xy2∗sumold+ny3
本质上需要的是立方和,只是维护的过程中需要和以及平方和,
为了方便下一次的操作修改,同时修改sum和sum2,
( w 1 ∗ x + y ) 2 + ( w 2 ∗ x + y ) 2 + ( w 3 ∗ x + y ) 2 (w_1*x+y)^2+(w_2*x+y)^2+(w_3*x+y)^2 (w1∗x+y)2+(w2∗x+y)2+(w3∗x+y)2
= ( x 2 w 1 2 + 2 x w 1 y + y 2 ) + ( x 2 w 2 2 + 2 x w 2 y + y 2 ) + ( x 2 w 3 2 + 2 x w 3 y + y 2 ) =(x^2w_1^2+2xw_1y+y^2)+(x^2w_2^2+2xw_2y+y^2)+(x^2w_3^2+2xw_3y+y^2) =(x2w12+2xw1y+y2)+(x2w22+2xw2y+y2)+(x2w32+2xw3y+y2)
= x 2 ( w 1 2 + w 1 2 + w 3 2 ) + 2 x y ( w 1 + w 1 + w 3 ) + 3 y 3 =x^2(w_1^2+w_1^2+w_3^2)+2xy(w_1+w_1+w_3)+3y^3 =x2(w12+w12+w32)+2xy(w1+w1+w3)+3y3
s u m 2 n e w = x 2 s u m 2 o l d + 2 x y ∗ s u m o l d + n y 2 sum2_{new}=x^2sum2_{old}+2xy*sum_{old}+ny^2 sum2new=x2sum2old+2xy∗sumold+ny2
( w 1 ∗ x + y ) + ( w 2 ∗ x + y ) + ( w 3 ∗ x + y ) (w_1*x+y)+(w_2*x+y)+(w_3*x+y) (w1∗x+y)+(w2∗x+y)+(w3∗x+y)
= x ( w 1 + w 2 + w 3 ) + 3 y =x(w_1+w_2+w_3)+3y =x(w1+w2+w3)+3y
s u m n e w = x ∗ s u m o l d + n y sum_{new}=x*sum_{old}+ny sumnew=x∗sumold+ny
小区间变化懒标记变化:
w
′
∗
x
′
+
y
′
=
(
x
w
+
y
)
∗
x
′
+
y
′
=
(
x
x
′
)
w
+
(
y
x
′
+
y
′
)
w'*x'+y'=(xw+y)*x'+y'=(xx')w+(yx'+y')
w′∗x′+y′=(xw+y)∗x′+y′=(xx′)w+(yx′+y′)
小区间的Mul
标记要乘上大区间的Mul
标记
小区间的Add
标记要先乘上大区间的Mul
标记,再加上Add
标记
最后,记个打代码中遇到的坑点:
- 用链式前向星mle 我懂了,以后都用vector
- 部分计算没有用到
long long
会导致答案错误 主要是mle,还以为卡longlong了,全改int了,然后有些地方就忘加了 - printf 和 cout 混用导致wa 因为这个翻车好几次了,看了牛客自测的结果,cout先输出print后输出,不知道是为啥导致的
版本2:LCT
咳咳,抱歉,没学过,还不会,先占个坑
树链剖分+线段树
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
int n, m, a[N];
vector<int> g[N];
int f[N], dep[N], son[N], sz[N];
/*---------------------树链剖分------------------------------*/
void dfs1(int u, int fa) {
f[u] = fa;
dep[u] = dep[fa] + 1;
sz[u] = 1;
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i];
if (v != fa) {
dfs1(v, u);
sz[u] += sz[v];
if (sz[v] > sz[son[u]]) {
son[u] = v;
}
}
}
}
int dfn, top[N], id[N];
ll w[N];
void dfs2(int u, int t) {
top[u] = t;
id[u] = ++dfn;
w[dfn] = a[u];
if (son[u])dfs2(son[u], t);
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i];
if (v != f[u] && v != son[u])
dfs2(v, v);
}
}
/*---------------------线段树------------------------------*/
ll Mul[N * 4], Add[N * 4];//懒标记 x,y
ll sum[N * 4], sum2[N * 4], sum3[N * 4];//和 平方和 立方和
void solve(int rt, ll x, ll y, int len) { //关键
if (x != 1) {
ll x2 = x * x % mod;//x^2
ll x3 = x2 * x % mod;//x^3
sum[rt] = sum[rt] * x % mod;
sum2[rt] = sum2[rt] * x2 % mod;
sum3[rt] = sum3[rt] * x3 % mod;
Mul[rt] = Mul[rt] * x % mod;
Add[rt] = Add[rt] * x % mod;
}
if (y != 0) {
ll y2 = y * y % mod;
ll y3 = y2 * y % mod;
//(x+y)^3=x^3+3x^2y+3xy^2+y^3
//sum3_{new}=x^3sum3_{old}+3x^2y*sum2_{old}+3xy^2*sum_{old}+ny^3
sum3[rt] = (sum3[rt] + len * y3 % mod) % mod;
sum3[rt] = (sum3[rt] + 3 * y * sum2[rt] % mod) % mod;
sum3[rt] = (sum3[rt] + 3 * y2 * sum[rt] % mod) % mod;
//(x+y)^2=x^2+2xy+y^2
//sum2_{new}=x^2sum2_{old}+2xy*sum_{old}+ny^2
sum2[rt] = (sum2[rt] + len * y2 % mod) % mod;
sum2[rt] = (sum2[rt] + 2 * sum[rt] * y % mod) % mod;
//sum_{new}=x*sum_{old}+ny
sum[rt] = (sum[rt] + len * y % mod) % mod;
Add[rt] = (Add[rt] + y) % mod;
}
}
void pushup(int rt) {
sum[rt] = (sum[rt << 1] + sum[rt << 1 | 1]) % mod;
sum2[rt] = (sum2[rt << 1] + sum2[rt << 1 | 1]) % mod;
sum3[rt] = (sum3[rt << 1] + sum3[rt << 1 | 1]) % mod;
}
void pushdown(int rt, int len) {
solve(rt << 1, Mul[rt], Add[rt], len - (len >> 1));
solve(rt << 1 | 1, Mul[rt], Add[rt], len >> 1);
Add[rt] = 0;
Mul[rt] = 1;
}
void build(int l, int r, int rt) {
Add[rt] = 0;
Mul[rt] = 1;
if (l == r) {
sum[rt] = w[l] % mod;
sum2[rt] = w[l] * w[l] % mod;
sum3[rt] = w[l] * w[l] % mod * w[l] % mod;
return;
}
int mid = l + r >> 1;
build(lson);
build(rson);
pushup(rt);
}
void update(int L, int R, int x, int y, int l, int r, int rt) {// w*x+y
if (L <= l && r <= R) {
solve(rt, x, y, r - l + 1);
return;
}
pushdown(rt, r - l + 1);
int mid = l + r >> 1;
if (L <= mid) update(L, R, x, y, lson);
if (R > mid) update(L, R, x, y, rson);
pushup(rt);
}
ll query(int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) {
return sum3[rt] % mod;
}
pushdown(rt, r - l + 1);
int mid = l + r >> 1;
ll res = 0;
if (L <= mid) res = (res + query(L, R, lson)) % mod;
if (R > mid) res = (res + query(L, R, rson)) % mod;
pushup(rt);
return res;
}
void updRange(int u, int v, int x, int y) {//修改w*x+y
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]]) swap(u, v);
update(id[top[u]], id[u], x, y, 1, n, 1);
u = f[top[u]];
}
if (dep[u] > dep[v])swap(u, v);
update(id[u], id[v], x, y, 1, n, 1);
}
ll qRange(int u, int v) {
ll res = 0;
while (top[u] != top[v]) {
if (dep[top[u]] < dep[top[v]])swap(u, v);
res = (res + query(id[top[u]], id[u], 1, n, 1)) % mod;
u = f[top[u]];
}
if (dep[u] > dep[v])swap(u, v);
res = (res + query(id[u], id[v], 1, n, 1)) % mod;
return res;
}
int main() {
int T;
scanf("%d", &T);
for (int cs = 1; cs <= T; ++cs) {
dfn = 0;
printf("Case #%d:\n", cs);
scanf("%d", &n);
for (int i = 1, u, v; i < n; ++i) {
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
dfs1(1, 0);
dfs2(1, 1);
build(1, n, 1);
scanf("%d", &m);
for (int i = 1, op, u, v, w; i <= m; ++i) {
scanf("%d%d%d", &op, &u, &v);
if (op == 1) {
scanf("%d", &w);
updRange(u, v, 0, w);// *0+w
} else if (op == 2) {
scanf("%d", &w);
updRange(u, v, 1, w);// *1+w
} else if (op == 3) {
scanf("%d", &w);
updRange(u, v, w, 0);// *w+0
} else {
printf("%lld\n", qRange(u, v));
}
}
for (int i = 0; i <= n; ++i) {
son[i] = 0;
g[i].clear();
}
}
return 0;
}
LCT