没有题目链接
一颗有 n 个节点的树,q 组询问,支持两种操作:1.单点修改 2.路径求和。(1 <= n, Q <= 1e5)
题解:
用 dfs 建出树的括号序列(好像也叫欧拉序),用基本的线段树维护这个括号序列,每个点在括号序列中为左括号时在线段树中加上该点权值,为右括号的位置减去该点权值,那么在一条路径中从起始点左括号到终点左括号一定包含路径中的每个点,并且不包含不再路径中的点(加了一次后又减去了)。
那么可以建立一颗有根树,每次更新时为两个单点更新(加一次减一次),每次查询时则是查询 根的左括号到 x 点的左括号之和 + 根的左括号到 y 点的左括号之和 - 2 * 根的左括号到 x 与 y 的 LCA 的左括号之和 + x 与 y 的 LCA 的权值。
由于没有交题的地方,就自己写了个对拍程序QAQ,和一位大佬的代码对拍。(附上源代码和对拍程序,如有错误欢迎指出)
对拍结果 100% 的代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define PI acos(-1.0)
#define INF 0x3f3f3f3f3f3f3f3f
#define P pair<int, int>
#define fastio ios::sync_with_stdio(false), cin.tie(0)
const int mod = 998244353;
const int M = 1000000 + 10;
const int N = 100000 + 10;
int n, q;
int val[N];
vector<int> G[N];
int dfn[N<<1], cnt;
int dep[N], gfa[40][N];
int segtr[N<<3], add[N], sub[N];
void dfs(int now, int f)
{
gfa[0][now] = f;
dfn[++cnt] = val[now];
add[now] = cnt;
for(int i = 0; i < G[now].size(); i ++) {
if(G[now][i] == f) continue;
dep[G[now][i]] = dep[now] + 1;
dfs(G[now][i], now);
}
dfn[++cnt] = -val[now];
sub[now] = cnt;
}
void build(int l, int r, int rt)
{
if(l == r) {
segtr[rt] = dfn[l];
return ;
}
int mid = (l + r) >> 1;
build(l, mid, rt << 1);
build(mid + 1, r, rt << 1 | 1);
segtr[rt] = segtr[rt << 1] + segtr[rt << 1 | 1];
}
void update(int pos, int c, int l, int r, int rt)
{
if(l == r) {
segtr[rt] = c;
return ;
}
int mid = (l + r) >> 1;
if(pos <= mid) update(pos, c, l, mid, rt << 1);
else update(pos, c, mid + 1, r, rt << 1 | 1);
segtr[rt] = segtr[rt << 1] + segtr[rt << 1 | 1];
}
int query(int L, int R, int l, int r, int rt)
{
if(L <= l && r <= R) return segtr[rt];
int mid = (l + r) >> 1, ans = 0;
if(L <= mid) ans += query(L, R, l, mid, rt << 1);
if(mid < R) ans += query(L, R, mid + 1, r, rt << 1 | 1);
return ans;
}
int lca(int u, int v)
{
if(dep[u] > dep[v]) swap(u, v);
for(int k = 0; k < 32; k ++) {
if((dep[v] - dep[u]) >> k & 1)
v = gfa[k][v];
}
if(u == v) return u;
for(int k = 31; k >= 0; k --) {
if(gfa[k][u] != gfa[k][v]) {
u = gfa[k][u];
v = gfa[k][v];
}
}
return gfa[0][u];
}
signed main()
{
fastio;
freopen("in.in", "r", stdin);
freopen("txb.out", "w", stdout);
cin >> n;
for(int i = 1; i <= n; i ++) cin >> val[i];
for(int i = 1, u, v; i <= n - 1; i ++) {
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
dep[1] = 1;
dfs(1, -1);
build(1, cnt, 1);
for(int k = 0; k + 1 < 32; k ++) {
for(int v = 1; v <= n; v ++) {
if(gfa[k][v] == -1) gfa[k+1][v] = -1;
else gfa[k+1][v] = gfa[k][gfa[k][v]];
}
}
cin >> q;
for(int i = 1, x, y; i <= q; i ++) {
char op;
cin >> op >> x >> y;
if(op == 'C') {
val[x] = y;
update(add[x], y, 1, cnt, 1);
update(sub[x], -y, 1, cnt, 1);
} else {
int xylca = lca(x, y), ans = 0;
ans += query(1, add[x], 1, cnt, 1);
ans += query(1, add[y], 1, cnt, 1);
ans -= 2 * query(1, add[xylca], 1, cnt, 1);
ans += val[xylca];
cout << ans << endl;
}
}
return 0;
}
/*
Rejoicing in hope, patient in tribulation.
*/
随机生成数据程序:(数据量都是1e5)
#include <bits/stdc++.h>
using namespace std;
int n, m, q, a[10010];
pair<int, int> e[1000005]; // 无向图,连通,不含重边、自环
map< pair<int, int>, bool > h;
int random(int n) {
return (long long)rand() * rand() % n;
}
signed main()
{
srand((unsigned)time(0));
freopen("in.in", "w", stdout);
n = 100000, m = 100000, q = 100000;
for (int i = 1; i <= n; i++) {
a[i] = random(m) + 1;
}
for (int i = 1; i < n; i++) {
int fa = random(i) + 1;
e[i] = make_pair(fa, i + 1);
h[e[i]] = h[make_pair(i + 1, fa)] = 1;
}
cout << n << endl;
for(int i = 1; i <= n; i ++) cout << a[i] << " ";
cout << endl;
for(int i = 1; i <= n - 1; i ++) {
cout << e[i].first << " " << e[i].second << endl;
}
cout << q << endl;
for(int i = 1; i <= q; i ++) {
int id = random(2), x, y;
if(id == 0) {
cout << "C ";
x = random(n) + 1, y = random(m) + 1;
}
else {
cout << "A ";
x = random(n) + 1, y = random(n) + 1;
}
cout << x << " " << y << endl;
}
return 0;
}
判题程序:
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int T = 1; T <= 20; T++) {
system("G:\\save\\judge\\random.exe");
clock_t st,ed;
st = clock();
system("G:\\save\\judge\\txb.exe");
ed = clock();
system("G:\\save\\judge\\cy.exe");
if (system("fc G:\\save\\judge\\txb.out G:\\save\\judge\\cy.out")) {
printf("Wrong Answer on test %d", T);
return 0;
}
else {
printf("Accepted, 测试点 #%d, 用时 ", T); cout << ed - st << "ms" << endl;
}
}
}