题意: 知道了一颗有 n 个节点的树和树上每条边的权值,起点为s,对应两种操作:
0 x 输出 当前节点到 x节点的最短距离,并移动到 x 节点位置
1 x val 把第 x 条边的权值改为 val
做法:首先这肯定是需要LCA求公共祖先的点,其实对于改变边权的操作,可以记录每条边的一个端点,
对其左区间+ 右区间-,这样的前缀和可以求出边权修改后的最短距离,也就是对应0操作。
1操作则对其树状数组修改即可。
这样的话自然需要DFS序对树形结构区间化,转成区间之后就OK了。
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-.
/// __.' ~. .~ `.__
/// .'// \./ \\`.
/// .'// | \\`.
/// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`.
/// .'//.-" `-. | .-' "-.\\`.
/// .'//______.============-.. \ | / ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx)
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;
#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+5;
//const int maxx=1e6+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}
inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}
void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;
int up[maxn][23], maxx[maxn][23];
int dep[maxn], dis[maxn];
int cnt, head[maxn];
int in[maxn],out[maxn];
int tot;
struct node {
int to, next, w, id;
}e[maxn<<1];
void init() {
me(head,-1); me(dis,0);
me(up,0); me(dep,0);
cnt = 0; me(maxx, 0);
}
void add(int u, int v, int w, int i) {
e[cnt] = node{v, head[u], w, i};
head[u] = cnt++;
}
void dfs(int u,int fa,int d) {
dep[u] = d + 1;
for(int i = 1 ; i < 20 ; i ++) {
up[u][i] = up[up[u][i-1]][i-1];
// maxx[u][i] = max(maxx[up[u][i-1]][i-1], maxx[u][i-1]);
}
for(int i = head[u] ; ~i ; i = e[i].next) {
int to = e[i].to;
if(to == fa) continue;
dis[to] = dis[u] + e[i].w;
up[to][0] = u;
// maxx[to][0] = e[i].w;
dfs(to, u, d+1);
}
}
int LCA_BZ(int u,int v) {
int mx = 0;
if(dep[u] < dep[v]) swap(u,v);
int k = dep[u] - dep[v];
for(int i = 19 ; i >= 0 ; i --) {
if((1<<i) & k) {
// mx = max(mx, maxx[u][i]);
u = up[u][i];
}
}
if(u == v) return u;
for(int i = 19 ; i >= 0 ; i --) {
if(up[u][i] != up[v][i]){
// mx = max(mx, maxx[u][i]);
// mx = max(mx, maxx[v][i]);
u = up[u][i];
v = up[v][i];
}
}
// return max(mx, max(maxx[u][0], maxx[v][0]));
return up[u][0];
}
int len(int u,int v) {
return dis[u] + dis[v] - 2 * dis[LCA_BZ(u,v)];
}
struct edge {
int x,y,val;
}Q[maxn];
int g[maxn];
void init1() {
me(in,0);
me(out,0);
tot=0;
}
void dfs1(int u,int fa) {
in[u]=++tot;
for(int i=head[u];~i;i=e[i].next) {
int v=e[i].to;
if(v==fa) continue;
g[e[i].id]=v;
dfs1(v,u);
}
out[u]=tot;
}
int d[maxn<<1];
int lowbit(int x) {
return x&(-x);
}
void update(int x,int val) {
W(x<maxn) {
d[x]+=val;
x+=lowbit(x);
}
}
int sum(int x) {
LL ans=0;
W(x) {
ans+=d[x];
x-=lowbit(x);
}
return ans;
}
int n,q,st;
void solve() {
W(s_3(n,q,st)!=EOF) {
init();
init1();
FOr(1,n,i) {
int u,v,w;
s_3(u,v,w);
Q[i]=(edge){u,v,w};
add(u,v,w,i);
add(v,u,w,i);
}
dfs(1,-1,0);
dfs1(1,-1);
// for(int i=1;i<=tot;i++){
// cout<<in[i]<<" "<<out[i]<<endl;
// }
FOr(1,n,i) {
update(in[g[i]],Q[i].val);
update(out[g[i]]+1,-Q[i].val);
}
W(q--) {
int op;
s_1(op);
if(op==0) {
int ed;
s_1(ed);
int lca=LCA_BZ(st,ed);
int ans=sum(in[st])+sum(in[ed])-2*sum(in[lca]);
st=ed;
print(ans);
}
else {
int t,val;
s_2(t,val);
update(in[g[t]],-Q[t].val);
update(out[g[t]]+1,Q[t].val);
update(in[g[t]],val);
update(out[g[t]]+1,-val);
Q[t].val=val;
}
}
}
}
int main() {
//freopen( "1.in" , "r" , stdin );
//freopen( "1.out" , "w" , stdout );
int t=1;
//init();
//s_1(t);
for(int cas=1;cas<=t;cas++) {
//printf("Case #%d: ",cas);
solve();
}
}