虚树+set+dfs序+LCA
题解:http://blog.csdn.net/regina8023/article/details/45502279
显然(也就是说我不会严谨证明),最终答案一定是所有有宝物的点之间相连形成的树的边权和的两倍。而且不论从哪个点出发,最短路长度都一样,都是边权的两倍(因为无论从起点往哪里走,总是要回来的)。
那我们就钦定DFS序最小的点为起点,然后发现只要沿着DFS递增的顺序走,就能遍历这个生成树,于是我们可以用set维护DFS序序列,搞一搞就好了。
#include<set>
#include<cstdio>
#include<algorithm>
#define N 100005
#define ll long long
using namespace std;
const int INF = 1<<29;
int ecnt, last[N], idcnt, id[N], pos[N], dep[N], siz[N], son[N], fa[N], top[N], fav[N];
ll dist[N];
struct edge{int next,to,val;}e[N<<1];
bool ins[N];
void addedge(int a, int b, int c)
{
e[++ecnt]=(edge){last[a],b,c};
last[a]=ecnt;
}
void dfs1(int x)
{
id[x] = ++idcnt;
pos[idcnt] = x;
dep[x]=dep[fa[x]]+1;
dist[x]=dist[fa[x]]+fav[x];
siz[x]=1;
for(int i = last[x]; i; i=e[i].next)
{
int y=e[i].to;
if(y==fa[x])continue;
fa[y]=x;
fav[y]=e[i].val;
dfs1(y);
siz[x]+=siz[y];
if(siz[y] > siz[son[x]])
son[x] = y;
}
}
void dfs2(int x)
{
if(son[fa[x]]==x)top[x]=top[fa[x]];
else top[x]=x;
for(int i = last[x]; i; i=e[i].next)
{
int y=e[i].to;
if(y==fa[x])continue;
dfs2(y);
}
}
int LCA(int a, int b)
{
while(top[a] != top[b])
{
if(dep[top[a]] < dep[top[b]])swap(a,b);
a = fa[top[a]];
}
return dep[a] > dep[b] ? b : a;
}
ll dis(int x, int y)
{
int z = LCA(x,y);
return dist[x] + dist[y] - 2 * dist[z];
}
set<int> s;
int left(int x)
{
if(s.empty())return x;
set<int>::iterator it = s.lower_bound(id[x]);
if(it == s.begin())return pos[*(--s.end())];
else return pos[*(--it)];
}
int right(int x)
{
if(s.empty())return x;
set<int>::iterator it = s.upper_bound(id[x]);
if(it == s.end())return pos[*s.begin()];
else return pos[*it];
}
int main()
{
int n, m;
scanf("%d%d",&n,&m);
for(int i = 1, a, b, c; i < n; i++)
{
scanf("%d%d%d",&a,&b,&c);
addedge(a,b,c);
addedge(b,a,c);
}
dfs1(1);
dfs2(1);
ll ans = 0;
int x, l, r;
while(m--)
{
scanf("%d",&x);
if(ins[x])
{
s.erase(id[x]);
l = left(x);
r = right(x);
ans += dis(l,r) - dis(l,x) - dis(x,r);
ins[x]=0;
}
else
{
l = left(x);
r = right(x);
s.insert(id[x]);
ans += - dis(l,r) + dis(l,x) + dis(x,r);
ins[x]=1;
}
printf("%lld\n",ans);
}
}