分析:
我们只需要对于每一个询问进行一遍点分治即可(时间上完全接受得了)
tip
st数组,vis数组和tot都需要初始化
//这里写代码片
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=10010;
int f[N],sz[N],root,sum,n,d[N],st[N],tot=0,tt,m,deep[N],ans;
struct node{
int x,y,v,nxt;
};
node way[N<<1];
bool vis[N];
void add(int u,int w,int z)
{
tot++;
way[tot].x=u;way[tot].y=w;way[tot].v=z;way[tot].nxt=st[u];st[u]=tot;
}
void getroot(int now,int fa)
{
f[now]=0;
sz[now]=1;
for (int i=st[now];i;i=way[i].nxt)
if (way[i].y!=fa&&!vis[way[i].y])
{
getroot(way[i].y,now);
sz[now]+=sz[way[i].y];
f[now]=max(f[now],sz[way[i].y]);
}
f[now]=max(f[now],sum-sz[now]);
if (f[now]<f[root]) root=now;
}
void getdeep(int now,int fa)
{
d[++tt]=deep[now];
for (int i=st[now];i;i=way[i].nxt)
if (way[i].y!=fa&&!vis[way[i].y])
{
deep[way[i].y]=deep[now]+way[i].v;
getdeep(way[i].y,now);
}
}
int cal(int now)
{
tt=0;
getdeep(now,0);
sort(d+1,d+1+tt);
int ans=0;
int l=1,r=tt;
while (l<r)
{
while (d[l]+d[r]>m&&r>l) r--;
int rr=r;
if (r<=l) break;
while (d[l]+d[r]==m)
{
ans++;
r--;
if (r<=l) break;
}
r=rr;
l++;
}
return ans;
}
void dfs(int now)
{
deep[now]=0;
ans+=cal(now);
vis[now]=1;
for (int i=st[now];i;i=way[i].nxt)
if (!vis[way[i].y])
{
deep[way[i].y]=way[i].v;
ans-=cal(way[i].y);
root=0; sum=sz[way[i].y];
getroot(way[i].y,0);
dfs(root);
}
}
int main()
{
while (scanf("%d",&n)!=EOF&&n)
{
memset(st,0,sizeof(st)); tot=0;
for (int i=1;i<=n;i++)
{
int x,y;
while (scanf("%d",&x)!=EOF&&x)
{
scanf("%d",&y);
add(i,x,y); add(x,i,y);
}
}
while (scanf("%d",&m)!=EOF&&m)
{
memset(vis,0,sizeof(vis));
sum=n; root=0; f[0]=N;
getroot(1,0);
ans=0;
dfs(root);
if (ans) printf("AYE\n");
else printf("NAY\n");
}
printf(".\n");
}
return 0;
}