poj2763 Housewife Wind

题面在这里

题目大意：

有一棵树，每条边有边权，一个人初始在s点。现在有两种操作，一是修改某条边的边权，二是询问这个人走到x点经过的边权总和，并移动到x点。

做法：

树剖。线段树维护区间和。（第一次树剖一次过qwq太感动了）

/*************************************************************
	Problem: poj 2763 Housewife Wind
	User: fengyuan
	Language: C++
	Result: Accepted
	Time: 2516 ms
	Memory: 9 MB
	Submit_Time: 2017-12-05 18:01:44
*************************************************************/

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cctype>
#include<vector>
#include<map>
#include<queue>
#include<string>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
#define down(i, x, y) for (int i = (x); i >= (y); i --)
#define mid ((l+r)/2)
#define lc (o<<1)
#define rc (o<<1|1)
#define pb push_back
#define mp make_pair
#define PII pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
typedef long long LL;
//head

const int N = 100010;
int n, q, s, cnt, clk;
int x[N], y[N], z[N], depth[N], fa[N], son[N], sz[N], top[N], head[N], val[N], p[N], sum[N<<2];
struct Edge{
	int to, nex, v;
}e[N<<1];

inline void add(int x, int y, int z)
{
	e[++ cnt].to = y;
	e[cnt].nex = head[x];
	e[cnt].v = z;
	head[x] = cnt;
}

inline void dfs(int u, int last, int s)
{
	depth[u] = s; fa[u] = last; sz[u] = 1;
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == last) continue;
		dfs(v, u, s+1); sz[u] += sz[v];
		if (!son[u] || sz[v] > sz[son[u]]) son[u] = v;
	}
}

inline void dfs2(int u, int t)
{
	top[u] = t; p[u] = ++ clk;
	if (son[u]) dfs2(son[u], t);
	for (int i = head[u]; i; i = e[i].nex){
		int v = e[i].to; if (v == fa[u] || v == son[u]) continue;
		dfs2(v, v);
	}
}

inline void pushup(int o)
{
	sum[o] = sum[lc] + sum[rc];
}

inline void build(int o, int l, int r)
{
	if (l == r){
		sum[o] = val[l];
		return;
	}
	build(lc, l, mid); build(rc, mid+1, r);
	pushup(o);
}

inline void update(int o, int l, int r, int x, int v)
{
	if (l == x && r == x){
		sum[o] = v;
		return;
	}
	if (x <= mid) update(lc, l, mid, x, v);
	else update(rc, mid+1, r, x, v);
	pushup(o);
}

inline int query(int o, int l, int r, int x, int y)
{
	if (l == x && r == y) return sum[o];
	if (y <= mid) return query(lc, l, mid, x, y);
	else if (x > mid) return query(rc, mid+1, r, x, y);
	else return query(lc, l, mid, x, mid) + query(rc, mid+1, r, mid+1, y);
}

inline int solve(int x, int y)
{
	int ret = 0;
	while (top[x] != top[y]){
		if (depth[top[x]] < depth[top[y]]) swap(x, y);
		ret += query(1, 1, n, p[top[x]], p[x]);
		x = fa[top[x]];
	}
	if (x == y) return ret;
	if (depth[x] > depth[y]) swap(x, y);
	return ret + query(1, 1, n, p[son[x]], p[y]);
}

int main()
{
	scanf("%d%d%d", &n, &q, &s);
	rep(i, 1, n-1){
		scanf("%d%d%d", &x[i], &y[i], &z[i]);
		add(x[i], y[i], z[i]); add(y[i], x[i], z[i]);
	}
	dfs(1, 0, 0); dfs2(1, 1);
	rep(i, 1, n-1){
		if (depth[x[i]] < depth[y[i]]) swap(x[i], y[i]);
		val[p[x[i]]] = z[i];
	}
	build(1, 1, n);
	while (q --){
		int type, u, v;
		scanf("%d", &type);
		if (type == 0){
			scanf("%d", &u);
			printf("%d\n", solve(s, u));
			s = u;
		} else {
			scanf("%d%d", &u, &v);
			update(1, 1, n, p[x[u]], v);
		}
	}
	return 0;
}