#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = 1e5;
const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];
int n, m;
int a[maxn];
string s;
struct Node{
// int val, id;
// bool operator<(const Node &u)const{
// return val < u.val;//!!!!!!!!!!!!!!!!!!
// }
int v, w;
};
//long long ? maxn ? n? m?
void solve(){
int res = 0;
int k, q;
cin >> n;
int sum = 0;
// for(int i = 1; i <= n; i++){
// cin >> a[i];
// }
vector<int> p(n + 5), l(n + 5), r(n + 5);
vector<vector<int>> G(n + 5);
for(int i = 2; i <= n; i++){
cin >> p[i];
G[p[i]].pb(i);
}
p[1] = 0;
for(int i = 1; i <= n; i++){
cin >> l[i] >> r[i];
}
vector<int> f(n + 5, 0), mx(n + 5, 0);
auto dfs = [&](auto self, int u, int p) -> void {
int sum = 0;
for(auto v: G[u]){
if(v == p) continue;
self(self, v, u);
sum += mx[v];
f[u] += f[v];
}
if(sum >= l[u]){
mx[u] = min(sum, r[u]);
}
else{
f[u]++;
mx[u] = r[u];
}
};
dfs(dfs, 1, 1);
cout << f[1] << '\n';
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--)
{
solve();
}
return 0;
}
Codeforces Round 800 (Div. 2) D. Fake Plastic Trees
最新推荐文章于 2024-07-12 18:56:03 发布