P3806 【模板】点分治1

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int (x)=(y);(x)<(z);x++)
#define mst(x,y) memset(x,y,sizeof(x))
#define ll long long
const int maxn=1e4+10;
const int maxk=1e7+10;
#define pii pair<int,int> 
#define piii pair<int,pii>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define debug cout<<"YES"<<endl;
int gcd(int x,int y){return y?gcd(y,x%y):x;}
struct node{
    int u,w,nxt;
}edge[maxn<<1];
int tot,head[maxn];
void init(){
    mst(head,-1),tot=0;
}
void addedge(int u,int v,int w){
    edge[tot]=node{v,w,head[u]};
    head[u]=tot++;
}
int n,m,rt,sum;
int sz[maxn],dis[maxn],maxp[maxn];
int jd[maxk],vis[maxn];
void getrt(int u,int f){
    sz[u]=1,maxp[u]=0;
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(v==f||vis[v]) continue;
        getrt(v,u);
        sz[u]+=sz[v];
        if(sz[v]>maxp[u]) maxp[u]=sz[v];
    }
    if(maxp[u]<sum-sz[u]) maxp[u]=sum-sz[u];
    if(maxp[u]<maxp[rt]) rt=u;
}
int tmp[maxn],cnt=0;
void getdis(int u,int f){
    tmp[cnt++]=dis[u];
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(v==f||vis[v]) continue;
        dis[v]=dis[u]+edge[i].w;
        getdis(v,u);
    }
}
int q[105],ans[105];
void solve(int u){
    queue<int> pq;
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(vis[v]) continue;
        cnt=0,dis[v]=edge[i].w;
        getdis(v,u);
        rep(j,0,cnt) rep(k,0,m) if(q[k]-tmp[j]>=0)
            ans[k]|=jd[q[k]-tmp[j]];
        rep(j,0,cnt){
            pq.push(tmp[j]);
            jd[tmp[j]]=1;
        }
    }
    while(!pq.empty()){
        jd[pq.front()]=0;
        pq.pop();
    }
}
void divide(int u){
    vis[u]=jd[0]=1;
    solve(u);
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(vis[v]) continue;
        maxp[rt=0]=sum=sz[v];
        getrt(v,u);
        getrt(rt,0);
        divide(rt);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    init();
    rep(i,0,n-1){
        int u,v,w;
        cin>>u>>v>>w;
        addedge(u,v,w);
        addedge(v,u,w);
    }
    rep(i,0,m) cin>>q[i];
    sum=n,maxp[rt=0]=n;
    getrt(1,0);
    getrt(rt,0);
    divide(rt);
    rep(i,0,m)cout<<(ans[i]?"AYE":"NAY")<<"\n";
    return 0;
}