传送门
背景:烁烁很喜欢爬树,这吓坏了树上的皮皮鼠。
题意:
给定一颗
n
n
n个节点的树,边权均为
1
1
1,初始树上没有皮皮鼠。
烁烁他每次会跳到一个节点
u
u
u,把周围与他距离不超过d的节点各吸引出
w
w
w只皮皮鼠。皮皮鼠会被烁烁吸引,所以会一直待在节点上不动。
烁烁很好奇,在当前时刻,节点
u
u
u 有多少个他的好朋友—皮皮鼠。
大意:
给一颗
n
n
n个节点的树,边权均为
1
1
1,初始点权均为
0
0
0,
m
m
m 次操作:
Q
Q
Q
x
x
x:询问
x
x
x 的点权。
M
M
M
x
x
x
d
d
d
w
w
w:将树上与节点
x
x
x 距离不超过
d
d
d 的节点的点权均加上
w
w
w。
分析
涉及某个点到其它点的路径,且要支持修改,考虑动态点分治
动态点分治这里有详解P6329 【模板】点分树 | 震波【动态点分治】详解
对于这题来说
按照动态点分治,构建出
f
a
t
h
e
r
father
father 数组
之后对于每个 Q Q Q,查询从当前节点开始,往上跳 f a fa fa,找到相对距离不超过 d d d的权值,减去 去重信息 里面的数
对于每个 M M M,同样从当前节点开始,往上跳 f a fa fa,给相对距离不超过 d d d 的节点加上权值,同时更新 去重信息
代码
普通区间加线段树
//P6329-solve
/*
@Author: YooQ
*/
#include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define ll long long
#define FILE_OUT freopen("out", "w", stdout);
#define FILE_IN freopen("1.in", "r", stdin);
#define debug(x) cout << #x << ": " << x << "\n";
#define AC 0
#define WA 1
#define INF 0x3f3f3f3f
const ll MAX_N = 1e6+5;
const ll MOD = 1e9+7;
int N, M, K;
int head[MAX_N];
int tot = 0;
struct Edge {
int to, nxt;
}edge[MAX_N];
void addEdge(int u, int v) {
edge[tot].nxt = head[u];
edge[tot].to = v;
head[u] = tot++;
edge[tot].nxt = head[v];
edge[tot].to = u;
head[v] = tot++;
}
int parent[MAX_N];
int sz[MAX_N];
int dep[MAX_N];
int top[MAX_N];
int son[MAX_N];
void dfs1(int u, int from) {
parent[u] = from;
dep[u] = dep[from] + 1;
son[u] = 0;
sz[u] = 1;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == from) continue;
dfs1(v, u);
sz[u] += sz[v];
if (sz[v] > sz[son[u]]) {
son[u] = v;
}
}
}
void dfs2(int u, int tp) {
top[u] = tp;
if (son[u]) dfs2(son[u], tp);
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == son[u] || v == parent[u]) continue;
dfs2(v, v);
}
}
int LCA(int x, int y) {
while (top[x] != top[y]) {
if (dep[top[x]] < dep[top[y]]) swap(x, y);
x = parent[top[x]];
}
return dep[x] < dep[y] ? x : y;
}
int dis(int x, int y) {
int lca = LCA(x, y);
return dep[x] + dep[y] - 2 * dep[lca];
}
int maxx[MAX_N];
bool vis[MAX_N];
void root(int u, int from, int& rt, int sum) {
sz[u] = 1;
maxx[u] = 0;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == from || vis[v]) continue;
root(v, u, rt, sum);
sz[u] += sz[v];
maxx[u] = max(maxx[u], sz[v]);
}
maxx[u] = max(maxx[u], sum - sz[u]);
if (maxx[u] < maxx[rt]) {
rt = u;
}
}
int dsz[MAX_N];
int father[MAX_N];
void divide(int u, int sum) {
vis[u] = 1;
dsz[u] = sum;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if (vis[v=edge[i].to]) continue;
int rt = 0;
int vsz = sz[v] < sz[u] ? sz[v] : sum - sz[u];
root(v, u, rt, vsz);
father[rt] = u;
divide(rt, vsz);
}
}
struct Tr {
int k, l, r, add;
}tr[MAX_N<<4];
int indx = 0;
int mk() {
return ++indx;
}
void calc(int& rt, int len, int k) {
if (!rt) rt = mk();
tr[rt].k += len * k;
tr[rt].add += k;
}
void push_down(int rt, int l, int r) {
if (!tr[rt].add) return;
int mid = l + ((r-l)>>1);
calc(tr[rt].l, mid - l + 1, tr[rt].add);
calc(tr[rt].r, r - mid, tr[rt].add);
tr[rt].add = 0;
}
void update(int &rt, int l, int r, int x, int y, int k) {
if (!rt) rt = mk();
if (x <= l && r <= y) {
calc(rt, r - l + 1, k);
return;
}
push_down(rt, l, r);
int mid = l + ((r-l)>>1);
if (x <= mid) update(tr[rt].l, l, mid, x, y, k);
if (y > mid) update(tr[rt].r, mid+1, r, x, y, k);
}
int query(int rt, int l, int r, int x) {
if (!rt) return 0;
if (l == r) {
return tr[rt].k;
}
push_down(rt, l, r);
int mid = l + ((r-l)>>1);
if (x <= mid) return query(tr[rt].l, l, mid, x);
if (x > mid) return query(tr[rt].r, mid+1, r, x);
}
int A[MAX_N], B[MAX_N];
void modify(int x, int k, int w) {
int d;
for (int i = x; i; i = father[i]) {
if (dis(x, i) <= k) {
update(A[i], 1, dsz[i] + 1, 1, k - dis(x, i) + 1, w);
}
if (father[i] && dis(x, father[i]) <= k) {
update(B[i], 1, dsz[father[i]] + 1, 1, k - dis(x, father[i]) + 1, w);
}
}
}
int ask(int x) {
int res = 0;
for (int i = x; i; i = father[i]) {
res += query(A[i], 1, dsz[i] + 1, dis(x, i) + 1);
if (father[i]) res -= query(B[i], 1, dsz[father[i]] + 1, dis(x, father[i]) + 1);
}
return res;
}
int arr[MAX_N];
void init() {
memset(head, -1, sizeof head);
tot = 0;
}
void solve(){
init();
sc("%d%d", &N, &M);
int u, v;
for (int i = 1; i < N; ++i) {
sc("%d%d", &u, &v);
addEdge(u, v);
}
dfs1(1, 0);
dfs2(1, 1);
int rt = 0;
maxx[0] = 1e8;
root(1, 0, rt, N);
divide(rt, N);
char opt[5];
int x, y, k;
for (int i = 1; i <= M; ++i) {
sc("%s", opt);
if (*opt == 'M') {
sc("%d%d%d", &x, &y, &k);
modify(x, y, k);
} else {
sc("%d", &x);
pr("%d\n", ask(x));
}
}
}
signed main()
{
#ifndef ONLINE_JUDGE
FILE_IN
FILE_OUT
#endif
int T = 1;//cin >> T;
while (T--) solve();
return AC;
}
逻辑上差分优化后的线段树
//P6329-solve
/*
@Author: YooQ
*/
#include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define ll long long
#define FILE_OUT freopen("out", "w", stdout);
#define FILE_IN freopen("1.in", "r", stdin);
#define debug(x) cout << #x << ": " << x << "\n";
#define AC 0
#define WA 1
#define INF 0x3f3f3f3f
const ll MAX_N = 1e6+5;
const ll MOD = 1e9+7;
int N, M, K;
int head[MAX_N];
int tot = 0;
struct Edge {
int to, nxt;
}edge[MAX_N];
void addEdge(int u, int v) {
edge[tot].nxt = head[u];
edge[tot].to = v;
head[u] = tot++;
edge[tot].nxt = head[v];
edge[tot].to = u;
head[v] = tot++;
}
int parent[MAX_N];
int sz[MAX_N];
int dep[MAX_N];
int top[MAX_N];
int son[MAX_N];
void dfs1(int u, int from) {
parent[u] = from;
dep[u] = dep[from] + 1;
son[u] = 0;
sz[u] = 1;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == from) continue;
dfs1(v, u);
sz[u] += sz[v];
if (sz[v] > sz[son[u]]) {
son[u] = v;
}
}
}
void dfs2(int u, int tp) {
top[u] = tp;
if (son[u]) dfs2(son[u], tp);
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == son[u] || v == parent[u]) continue;
dfs2(v, v);
}
}
int LCA(int x, int y) {
while (top[x] != top[y]) {
if (dep[top[x]] < dep[top[y]]) swap(x, y);
x = parent[top[x]];
}
return dep[x] < dep[y] ? x : y;
}
int dis(int x, int y) {
int lca = LCA(x, y);
return dep[x] + dep[y] - 2 * dep[lca];
}
int maxx[MAX_N];
bool vis[MAX_N];
void root(int u, int from, int& rt, int sum) {
sz[u] = 1;
maxx[u] = 0;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if ((v=edge[i].to) == from || vis[v]) continue;
root(v, u, rt, sum);
sz[u] += sz[v];
maxx[u] = max(maxx[u], sz[v]);
}
maxx[u] = max(maxx[u], sum - sz[u]);
if (maxx[u] < maxx[rt]) {
rt = u;
}
}
int dsz[MAX_N];
int father[MAX_N];
void divide(int u, int sum) {
vis[u] = 1;
dsz[u] = sum;
int v;
for (int i = head[u];~i;i=edge[i].nxt) {
if (vis[v=edge[i].to]) continue;
int rt = 0;
int vsz = sz[v] < sz[u] ? sz[v] : sum - sz[u];
root(v, u, rt, vsz);
father[rt] = u;
divide(rt, vsz);
}
}
struct Tr {
int k, l, r, add;
}tr[MAX_N<<4];
int indx = 0;
int mk() {
return ++indx;
}
void update(int& rt, int l, int r, int x, int k) {
if (!rt) rt = mk();
tr[rt].k += k;
if (l == r) return;
int mid = l + ((r-l)>>1);
if (x <= mid) update(tr[rt].l, l, mid, x, k);
if (x > mid) update(tr[rt].r, mid+1, r, x, k);
}
int query(int rt, int l, int r, int x) {
if (!rt) return 0;
if (l == r) {
return tr[rt].k;
}
int mid = l + ((r-l)>>1);
if (x <= mid) return tr[tr[rt].r].k + query(tr[rt].l, l, mid, x);
if (x > mid) return query(tr[rt].r, mid+1, r, x);
}
int A[MAX_N], B[MAX_N];
void modify(int x, int k, int w) {
int d;
for (int i = x; i; i = father[i]) {
if (dis(x, i) <= k) {
update(A[i], 1, dsz[i] + 1, k - dis(x, i) + 1, w);
}
if (father[i] && dis(x, father[i]) <= k) {
update(B[i], 1, dsz[father[i]] + 1, k - dis(x, father[i]) + 1, w);
}
}
}
int ask(int x) {
int res = 0;
for (int i = x; i; i = father[i]) {
res += query(A[i], 1, dsz[i] + 1, dis(x, i) + 1);
if (father[i]) res -= query(B[i], 1, dsz[father[i]] + 1, dis(x, father[i]) + 1);
}
return res;
}
int arr[MAX_N];
void init() {
memset(head, -1, sizeof head);
tot = 0;
}
void solve(){
init();
sc("%d%d", &N, &M);
int u, v;
for (int i = 1; i < N; ++i) {
sc("%d%d", &u, &v);
addEdge(u, v);
}
dfs1(1, 0);
dfs2(1, 1);
int rt = 0;
maxx[0] = 1e8;
root(1, 0, rt, N);
divide(rt, N);
char opt[5];
int x, y, k;
for (int i = 1; i <= M; ++i) {
sc("%s", opt);
if (*opt == 'M') {
sc("%d%d%d", &x, &y, &k);
modify(x, y, k);
} else {
sc("%d", &x);
pr("%d\n", ask(x));
}
}
}
signed main()
{
#ifndef ONLINE_JUDGE
FILE_IN
FILE_OUT
#endif
int T = 1;//cin >> T;
while (T--) solve();
return AC;
}