关于复杂度

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int MAXN=5e5+5;

int n;
ll val[MAXN],cnt[MAXN];
vector<int> son[MAXN];
ll sum=0;
priority_queue<ll> q[MAXN];
int idx[MAXN];

int merge(int x,int y){
	if(x==y) return x;
	x=idx[x],y=idx[y];
	if(q[x].size()<q[y].size()) swap(x,y);
	while(!q[y].empty()){
		q[x].push(q[y].top());
		q[y].pop();
	}
	return x;
}//

void dfs(int u){
	for(int v:son[u]){
		dfs(v);
		idx[u]=merge(u,v);
	}
	q[idx[u]].push(val[u]*(2*cnt[u]+1));
	sum+=val[u]*(2*cnt[u]+1);
	++cnt[u];
        //------------以下有疑义
	while(!q[idx[u]].empty() && q[idx[u]].top()>val[u]*(2*cnt[u]+1)){
		sum+=val[u]*(2*cnt[u]+1)-q[idx[u]].top();
		q[idx[u]].pop();
		q[idx[u]].push(val[u]*(2*cnt[u]+1));
		++cnt[u];
	}
}//

int main(){
	scanf("%d",&n);
	for(int i=2,x;i<=n;++i){
		scanf("%d",&x);
		son[x].push_back(i);
	}
	for(int i=1;i<=n;++i) scanf("%lld",&val[i]),idx[i]=i;
	dfs(1);
	printf("%lld",sum);
	return 0;
}