Submission #1793012

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,h[100005],L[100005],d[100005];
vector<P>edge[100005];
vector<int>za;
int ans[100005];
int dfs(int v,int u,int sum){
	int ret = sum; h[v] = sum;
	for(int i=0;i<edge[v].size();i++){
		if(edge[v][i].fi==u) continue;
		ret = max(ret,dfs(edge[v][i].fi,v,sum+edge[v][i].sc));
	}
	return d[v] = ret;
}
struct BIT
{
	int bit[(1<<17)+5];
	int f(int x)
	{
		return x&-x;
	}
	void add(int i,int x)
	{
		for(int s=i;s<=(1<<17);s+=f(s)) bit[s]+=x;
	}
	int sum(int i)
	{
		int res=0;
		for(int s=i;s>0;s-=f(s)) res+=bit[s];
		return res;
	}
}bit;
void DFS(int v,int u){
	int a = POSL(za,h[v]);
	int zip = bit.sum((1<<17)) - bit.sum(a+1);
	zip += edge[v].size();
	if(u!=-1) zip--;
	ans[a] = min(ans[a],zip);
	for(int i=0;i<edge[v].size();i++){
		if(edge[v][i].fi==u) continue;
		int b = POSL(za,d[edge[v][i].fi]);
		bit.add(b+1,1);
	}
	for(int i=0;i<edge[v].size();i++){
		if(edge[v][i].fi==u) continue;
		int b = POSL(za,d[edge[v][i].fi]);
		bit.add(b+1,-1);
		DFS(edge[v][i].fi,v);
		bit.add(b+1,1);
	}
	for(int i=0;i<edge[v].size();i++){
		if(edge[v][i].fi==u) continue;
		int b = POSL(za,d[edge[v][i].fi]);
		bit.add(b+1,-1);
	}
	return;
}
int main(){
	cin>>n;
	repn(i,n){
		cin>>L[i];
	}
	for(int i=2;i<=n;i++){
		int x; cin>>x;
		edge[x].pb(mp(i,L[i]));
		edge[i].pb(mp(x,L[i]));
	}
	dfs(1,-1,L[1]);
	for(int i=1;i<=n;i++){
		za.pb(d[i]);
		za.pb(h[i]);
	}
	SORT(za); ERASE(za);
	fill(ans,ans+100005,INF);
	DFS(1,-1);
	int q; cin>>q;
	rep(i,q){
		int x; cin>>x;
		if(POSL(za,x) == za.size() || za[POSL(za,x)] != x) puts("-1");
		else printf("%d\n",ans[POSL(za,x)]);
	}
}

Submission Info

Judge Result