【JZOJ 5248】【NOIP2017提高A组模拟8.10】花花的聚会

Description

Solution

Code

#include <cstdio>
#include <cstdlib>
#include <cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define efo(i,q) for(int i=A[q];i;i=B[i][0])
#define min(q,w) ((q)>(w)?(w):(q))
using namespace std;
const int N=100500;
int read(int &n)
{
char ch=' ';int q=0,w=1;
for(;(ch!='-')&&((ch<'0')||(ch>'9'));ch=getchar());
if(ch=='-')w=-1,ch=getchar();
for(;ch>='0' && ch<='9';ch=getchar())q=q*10+ch-48;n=q*w;return n;
}
int m,n,ans;
int a
;
int B[2*N][2],A
,B0;
int B1[2*N][3],A1
,B10;
int b1
[2];//ci  pay
int er[20],lg
;
int rmq
[20],f
;
void link(int q,int w)
{
B[++B0][0]=A[q],A[q]=B0,B[B0][1]=w;
B[++B0][0]=A[w],A[w]=B0,B[B0][1]=q;
}
void link1(int q,int w,int e)
{
B1[++B10][0]=A1[q],A1[q]=B10,B1[B10][1]=w,B1[B10][2]=e;
}
int RMQ(int l,int r){return min(rmq[r][lg[r-l+1]],rmq[l-1+er[lg[r-l+1]]][lg[r-l+1]]);}
void dfs(int q,int fa,int c)
{
f[q]=2e9;
for(int i=A1[q];i;i=B1[i][0])
{
int t=B1[i][2];
if(B1[i][1]<c-1)t+=RMQ(c-B1[i][1],c-1);
f[q]=min(f[q],t);
}
rmq[c][0]=f[q];
fo(i,1,19)if(c-er[i-1]>0)rmq[c][i]=min(rmq[c][i-1],rmq[c-er[i-1]][i-1]);
else rmq[c][i]=rmq[c][i-1];
efo(i,q)if(B[i][1]!=fa)dfs(B[i][1],q,c+1);
}
int main()
{
int q,w,e;
read(n),read(m);
fo(i,1,n)lg[i]=log2(i);
er[0]=1;fo(i,1,19)er[i]=er[i-1]<<1;
fo(i,1,n-1)read(q),read(w),link(q,w);
fo(i,1,m)read(q),read(w),read(e),link1(q,w,e);
dfs(1,0,1);
read(m);
f[1]=0;
fo(i,1,m)read(q),printf("%d\n",f[q]);
return 0;
}