洛谷P3038 [USACO11DEC]牧草种植Grass Planting
标签
- 树链剖分
- 边权化点权
- 线段树
简明题意
- 给树,支持两种操作:
- u–v路径所有的边权+1
- 查询u–v的边权和
思路
- 边权化点权,化完剖,剖完线段树维护,有点水
注意事项
- 就是注意LCA处的处理
总结
- 无
AC代码
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int n, m;
vector<int> g[maxn];
int dep[maxn], fa[maxn], siz[maxn], son[maxn];
void dfs1(int u, int f, int deep)
{
dep[u] = deep;
fa[u] = f;
siz[u] = 1;
int max_son = -1;
for (auto& v : g[u])
if (v != f)
{
dfs1(v, u, deep + 1);
siz[u] += siz[v];
if (siz[v] > max_son)
max_son = siz[v], son[u] = v;
}
}
int top[maxn], id[maxn], cnt;
void dfs2(int u, int topf)
{
top[u] = topf;
id[u] = ++cnt;
if (son[u])
{
dfs2(son[u], topf);
for (auto& v : g[u])
if (v != fa[u] && v != son[u])
dfs2(v, v);
}
}
struct Node
{
int l, r, sum;
int tag;
};
Node tree[maxn * 4];
void build(int o, int l, int r)
{
tree[o].l = l, tree[o].r = r;
if (l == r)
return;
int mid = (l + r) / 2;
build(o * 2, l, mid);
build(o * 2 + 1, mid + 1, r);
}
void spread(int o)
{
if (tree[o].tag)
{
tree[o].sum += tree[o].tag * (tree[o].r - tree[o].l + 1);
if (tree[o].l != tree[o].r)
tree[o * 2].tag += tree[o].tag, tree[o * 2 + 1].tag += tree[o].tag;
tree[o].tag = 0;
}
}
void update(int o)
{
if (tree[o].l != tree[o].r)
{
spread(o * 2), spread(o * 2 + 1);
tree[o].sum = tree[o * 2].sum + tree[o * 2 + 1].sum;
}
}
void change(int o, int l, int r)
{
spread(o);
if (tree[o].l == l && tree[o].r == r)
{
tree[o].tag++;
spread(o);
return;
}
int mid = (tree[o].l + tree[o].r) / 2;
if (r <= mid)
change(o * 2, l, r);
else if (l > mid)
change(o * 2 + 1, l, r);
else
change(o * 2, l, mid), change(o * 2 + 1, mid + 1, r);
update(o);
}
int ask(int o, int l, int r)
{
spread(o);
if (tree[o].l == l && tree[o].r == r)
return tree[o].sum;
int mid = (tree[o].l + tree[o].r) / 2;
if (r <= mid)
return ask(o * 2, l, r);
else if (l > mid)
return ask(o * 2 + 1, l, r);
else
return ask(o * 2, l, mid) + ask(o * 2 + 1, mid + 1, r);
}
void solve()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i < n; i++)
{
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v), g[v].push_back(u);
}
dfs1(1, 1, 1);
dfs2(1, 1);
build(1, 1, n);
while (m--)
{
char cmd[10];
int u, v;
scanf("%s%d%d", cmd, &u, &v);
if (cmd[0] == 'P')
{
while (top[u] != top[v])
{
if (dep[top[v]] < dep[top[u]]) swap(u, v);
change(1, id[top[v]], id[v]);
v = fa[top[v]];
}
if (u != v)
change(1, min(id[u], id[v]) + 1, max(id[u], id[v]));
}
else
{
int ans = 0;
while (top[u] != top[v])
{
if (dep[top[v]] < dep[top[u]]) swap(u, v);
ans += ask(1, id[top[v]], id[v]);
v = fa[top[v]];
}
if (u != v)
ans += ask(1, min(id[u], id[v]) + 1, max(id[u], id[v]));
printf("%d\n", ans);
}
}
}
int main()
{
freopen("Testin.txt", "r", stdin);
freopen("Testout.txt", "w", stdout);
solve();
return 0;
}
双倍经验
- 无