BZOJ4719 [Noip2016]天天爱跑步

考虑链上做法，发现就是把每个路径拆成一次加入和一次删除，然后从前往后扫，走一步所有路径经过当前点的时间就要么加一，要么减一，且要么是一直加一，要么是一直减一，可以用两个数组和指针来维护整体加减

用链剖把一个区间转换成O(log n)个区间，即可在树上做

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<bitset>
#include<queue>
#include<set>
#include<stack>
using namespace std;
#define MAXN 300010
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define INF 1000000000
#define MOD 1000000007
struct vec{
	int to;
	int fro;
};
struct data{
	int s;
	int f;
	int o;
	data(){
		
	}
	data(int _s,int _f,int _o){
		s=_s;
		f=_f;
		o=_o;
	}
};
int read(){
	int re=0;
	char c;
	while(1){
		c=getchar();
		if(c>='0'&&c<='9'){
			re=c-'0';
			break;
		}
	}
	while(1){
		c=getchar();
		if(c<'0'||c>'9'){
			break;
		}
		re=re*10+c-'0';
	}
	return re;
}
vector<data>c[MAXN];
vec mp[MAXN*2];
int tai[MAXN],cnt;
int fa[MAXN],son[MAXN],dep[MAXN],siz[MAXN],tp[MAXN],dfn[MAXN],ndf[MAXN],tim;
int w[MAXN];
int n,m;
int CT1[MAXN*4],CT2[MAXN*4];
int *ct1=CT1+MAXN*2+5,*ct2=CT2+MAXN*2+5;
int ans[MAXN];
inline void be(int x,int y){
	mp[++cnt].to=y;
	mp[cnt].fro=tai[x];
	tai[x]=cnt;
}
inline void bde(int x,int y){
	be(x,y);
	be(y,x);
}
void dfs1(int x){
	int i,y;
	siz[x]=1;
	dep[x]=dep[fa[x]]+1;
	for(i=tai[x];i;i=mp[i].fro){
		y=mp[i].to;
		if(!siz[y]){
			fa[y]=x;
			dfs1(y);
			siz[x]+=siz[y];
			if(siz[y]>siz[son[x]]){
				son[x]=y;
			}
		}
	}
}
void dfs2(int x,int z){
	int i,y;
	ndf[dfn[x]=++tim]=x;
	tp[x]=z;
	if(son[x]){
		dfs2(son[x],z);
		for(i=tai[x];i;i=mp[i].fro){
			y=mp[i].to;
			if(!dfn[y]){
				dfs2(y,y);
			}
		}
	}
}
int dis(int x,int y){
	int re=0;
	while(tp[x]!=tp[y]){
		if(dep[tp[x]]<dep[tp[y]]){
			swap(x,y);
		}
		re+=dep[x]-dep[tp[x]]+1;
		x=fa[tp[x]];
	}
	if(dep[x]>dep[y]){
		swap(x,y);
	}
	re+=dep[y]-dep[x];
	return re;
}
void change(int x,int y,int dx,int dy){
	int fx=1,fy=-1;
	while(tp[x]!=tp[y]){
		if(dep[tp[x]]<dep[tp[y]]){
			swap(x,y);
			swap(dx,dy);
			swap(fx,fy);
		}
		c[dfn[tp[x]]].push_back(data(dx+(dep[x]-dep[tp[x]])*fx,fy,1));
		c[dfn[x]+1].push_back(data(dx-fx,fy,-1));
		dx+=(dep[x]-dep[tp[x]]+1)*fx;
		x=fa[tp[x]];
	}
	if(dep[x]>dep[y]){
		swap(x,y);
		swap(dx,dy);
		swap(fx,fy);
	}
	c[dfn[x]].push_back(data(dy+(dep[y]-dep[x])*fy,fx,1));
	c[dfn[y]+1].push_back(data(dy-fy,fx,-1));
}
int main(){
	int i,j,x,y;
	n=read();
	m=read();
	for(i=1;i<n;i++){
		x=read();
		y=read();
		bde(x,y);
	}
	dfs1(1);
	dfs2(1,1);
	for(i=1;i<=n;i++){
		w[i]=read();
	}
	for(i=1;i<=m;i++){
		x=read();
		y=read();
		change(x,y,0,dis(x,y));
	}
	for(i=1;i<=n;i++){
		for(j=0;j<c[i].size();j++){
			if(c[i][j].f==1){
				ct1[c[i][j].s]+=c[i][j].o;
			}else{
				ct2[c[i][j].s]+=c[i][j].o;
			}
		}
		ans[ndf[i]]=ct1[w[ndf[i]]]+ct2[w[ndf[i]]];
		ct1--;
		ct2++;
	}
	for(i=1;i<=n;i++){
		printf("%d ",ans[i]);
	}
	printf("\n");
	return 0;
}

/*

*/