蒟蒻求条

#include<bits/stdc++.h>
#define ll long long
#define MAX 1000001
using namespace std;
vector<int> E[MAX];
vector<int> sum;
int w[MAX], c[MAX];
int ans[MAX], n, p, pos;
void dfs(int u){
	sum.push_back(sum.back() + w[u]);
	int pos = 0;
	int l = 0, r = sum.size() - 1;
	while(l <= r){
		int mid = l + (r - l) / 2;
		if (sum.back() - sum[mid] <= c[u]){
			pos = mid;
			r = mid - 1;
		}else{
			l = mid + 1;
		}
	}
	ans[u] = sum.size() - pos - 1;
	for (auto i : E[u]) dfs(i);
	sum.pop_back();
}
int main(){
	cin >> n;
	for ( int i = 2 ; i <= n ; i++ ){
		cin >> p;
		E[p].push_back(i);
	}
	for ( int i = 1 ; i <= n ; i++ ){
		cin >> w[i];
	}
	for ( int i = 1 ; i <= n ; i++ ){
		cin >> c[i];
	}
	sum.push_back(0);
	dfs(1);
	for ( int i = 1 ; i <= n ; i++ ){
		cout << ans[i] << " ";
	}
	return 0;
}