记录一个菜逼的成长。。
题目链接
题目大意:
n个点,m个操作,初始位置为s
有两个操作:
1.ope to :输出从s到to的路径长度,并将to赋值给s
2.ope i v :将第i条边的长度改为v
基于边权,要将边权转化为点权。
将这条边的值作为这条边两端点深度大的点权即可
接着用线段树维护即可。
PS:差点wa到吐血。。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
const int maxn = 100000 + 10;
int eg[maxn][3];//用于存边
int head[maxn],cnt;
struct Edge{
int to,next;
}edge[maxn<<1];
void add(int u,int v)
{
edge[cnt].to = v;
edge[cnt].next = head[u];
head[u] = cnt++;
}
int num;
int val[maxn],siz[maxn],dep[maxn],son[maxn];
int top[maxn],tid[maxn],pos[maxn],fa[maxn];
void init()
{
cl(head,-1);cl(son,-1);
cnt = num = 0;
}
///树链剖分部分
void dfs1(int u,int father,int d)
{
dep[u] = d;
fa[u] = father;
siz[u] = 1;
for(int i = head[u]; ~i; i = edge[i].next)
{
int v = edge[i].to;
if(v != father)
{
dfs1(v,u,d+1);
siz[u] += siz[v];
if(son[u] == -1 || siz[v] > siz[son[u]])
son[u] = v;
}
}
}
void dfs2(int u,int tp)
{
top[u] = tp;
tid[u] = ++num;
pos[tid[u]] = u;
if(son[u] == -1) return;
dfs2(son[u],tp);
for(int i = head[u]; ~i; i = edge[i].next)
{
int v = edge[i].to;
if(v != son[u] && v != fa[u])
dfs2(v,v);
}
}
///线段树部分
struct Node{
int l,r,sum;
}node[maxn<<2];
void pushup(int t)
{
node[t].sum = node[t<<1].sum + node[t<<1|1].sum;
}
void build(int t,int l,int r)
{
node[t].l = l;
node[t].r = r;
if(l == r){
node[t].sum = 0;//初始化为0,之后再更新
return ;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
pushup(t);
}
void update(int t,int ind,int v)
{
if(node[t].l == node[t].r && node[t].l == ind){
node[t].sum = v;
return ;
}
int mid = (node[t].l + node[t].r) >> 1;
if(ind <= mid)update(t<<1,ind,v);
else update(t<<1|1,ind,v);
pushup(t);
}
int query(int t,int l,int r)
{
if(node[t].l >= l && node[t].r <= r){
return node[t].sum;
}
int ret = 0;
int mid = (node[t].l + node[t].r) >> 1;
if(l <= mid)ret += query(t<<1,l,r);
if(r > mid)ret += query(t<<1|1,l,r);
return ret;
}
int solveSum(int x,int y)
{
int ret = 0;
while(top[x] != top[y]){
if(dep[top[x]] < dep[top[y]])swap(x,y);
ret += query(1,tid[top[x]],tid[x]);
x = fa[top[x]];
}
if(dep[x] > dep[y])swap(x,y);
//假设x->y有n个点,其实只有n-1条边。所以要减去x的点值,这个值代表的是与x的父亲的所连边的值,不包括在内
return ret + query(1,tid[x],tid[y]) - query(1,tid[x],tid[x]);
}
int main()
{
int n,q,s;
while(~scanf("%d%d%d",&n,&q,&s)){
init();
for( int i = 1; i < n; i++ ){
scanf("%d%d%d",&eg[i][0],&eg[i][1],&eg[i][2]);
add(eg[i][0],eg[i][1]);
add(eg[i][1],eg[i][0]);
}
dfs1(1,0,0);
dfs2(1,1);
build(1,1,n);
//将边权转化为点权
for( int i = 1; i < n; i++ ){
if(dep[eg[i][0]] < dep[eg[i][1]])swap(eg[i][0],eg[i][1]);
update(1,tid[eg[i][0]],eg[i][2]);
}
int ope;
while(q--){
scanf("%d",&ope);
if(ope){
int u,v;
scanf("%d%d",&u,&v);
update(1,tid[eg[u][0]],v);
}
else {
int to;
scanf("%d",&to);
printf("%d\n",solveSum(s,to));
s = to;
}
}
}
return 0;
}