传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=2783
论审题的重要性……
没看见深度限制,写了0.5h的点分治……
一遍dfs,平衡树记录一下
Code:
#include<cstdio>
#include<vector>
#include<map>
#include<iostream>
using namespace std;
const int maxn=1e5+5;
int n,S;
int w[maxn],d[maxn];
vector<int>G[maxn];
long long ans=0;
map<int,int>M;
void dfs(int u,int f){
M[d[u]]++;
for(int i=0,v;i<G[u].size();i++){
if((v=G[u][i])!=f){
d[v]=d[u]+w[v];
ans+=M[d[v]-S];
dfs(v,u);
}
}if(!--M[d[u]])M.erase(d[u]);
}
int main(){
scanf("%d%d",&n,&S);
for(int i=1;i<=n;++i)scanf("%d",&w[i]);
for(int i=1;i<n;i++){
int u,v;scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}d[1]=w[1];M[0]=1;
dfs(1,1);
cout<<ans<<endl;
}