RT 顺便贴上我的淀粉代码

#include<bits/stdc++.h>
using namespace std;
#define maxn 10010
#define maxk 10000000
struct ed
{
    int next , to , data;
}e[maxn << 1];
int head[maxn],ide;
inline void add(int x , int y , int z)
{
    e[++ ide].data = z;
    e[ide].next = head[x];
    e[ide].to = y;
    head[x] = ide;
}
int n,m,q[maxn];
int g1,g2,g3;
int siz[maxn],maxp[maxn],dis[maxn],vis[maxn],tmp[maxn],st[maxn],ans[maxn];
int b[maxk + 1];
int rt,sum,cnt,tail;
void getr(int x , int fa)
{
    siz[x] = 1 , maxp[x] = 0;
    for(int i = head[x] ; i ; i = e[i].next)
    {
        int to = e[i].to;
        if(to == fa || vis[to]) continue;
        getr(to , x);
        siz[x] += siz[to];
        maxp[x] = max(maxp[x] , siz[to]);
    }
    maxp[x] = max(maxp[x] , sum - siz[x]);
    if(maxp[x] < maxp[rt]) rt = x;
}

void getd(int x , int fa)
{
    tmp[++ cnt] = dis[x];
    for(int i = head[x] ; i ; i = e[i].next)
    {
        int to = e[i].to;
        if(to == fa || vis[to]) continue;
        dis[to] = dis[x] + e[i].data; 
    }
}
void solve(int x)
{
    for(int i = head[x] ; i ; i = e[i].next)
    {
        int to = e[i].to;
        if(vis[to]) continue;
        cnt = 0;
        dis[to] = e[i].data;
        getd(to , x);
        for(int j = 1 ; j <= cnt ; ++ j)
        {
            for(int k = 1 ; k <= m ; ++ k)
                ans[k] |= b[q[k] - tmp[j]];
            if(tmp[j] <= maxk)
            {
                b[tmp[j]] = 1;
                st[++ tail] = tmp[j];
            }
        }
    }
    while(tail) b[st[tail --]] = 0;
}

void div(int x)
{
    vis[x] = 1;
    solve(x);
    for(int i = head[x] ; i ; i = e[i].next)
    {
        int to = e[i].to;
        if(vis[to]) continue;
        rt = 0;
        maxp[rt] = sum = siz[to];
        getr(to , x);
        div(rt);
    }
}
inline int read()
{
    int x = 0 ; char c = getchar();
    while(c < '0' || c > '9') c = getchar();
    while(c >= '0' && c <= '9') x = x * 10 + c - '0' , c = getchar();
    return x;
}
int main()
{
    n = read() , m = read();
    for(int i = 1 ; i < n ; ++ i)
    {
        g1 = read() , g2 = read() , g3 = read();
        add(g1 , g2 , g3) , add(g2 , g1 , g3);
    }
    for(int i = 1 ; i <= m ; ++ i) q[i] = read();
    b[0] = 1;
    maxp[0] = sum = n;
    getr(1 , 0);
    getr(rt , 0);
    div(rt);
    for(int i = 1 ; i <= m ; ++ i)
        if(ans[i]) printf("AYE\n");
        else printf("NAY\n");
    return 0;
}