#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define endl '\n'
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<vector<int>>adj(100'001);
vector<pair<int,int>>fruits[100'001];
for (int i = 0; i < n - 1; i++){
int x; cin >> x; --x;
adj[x].push_back(i+1);
adj[i+1].push_back(x);
}
for (int i = 0; i < m; i++){
int a,b,c;
cin >> a >> b >> c;
--a;
fruits[a].push_back({b,c});
}
unordered_map<int,long long>dp[100'001];
function<void(int,int)>dfs = [&](int u, int p){
for(int& x : adj[u]){
if (x == p)continue;
dfs(x,u);
for (auto j : dp[x]){
dp[u][j.first] += j.second;
}
dp[x].clear();
}
//take this one
if (fruits[u].size() > 0){
long long res = fruits[u][0].second;
while(res){
auto it = dp[u].upper_bound(fruits[u][0].first);
if (it == dp[u].end()){
break;
}
if (it->second <= res){
res -= it->second;
dp[u].erase(it);
}else{
it->second -= res;
break;
}
}
dp[u][fruits[u][0].first] += fruits[u][0].second;
}
};
dfs(0,0);
long long ans = 0;
for (auto j : dp[0])ans += j.second;
cout << ans << endl;
return 0;
}
Compilation message
magictree.cpp: In lambda function:
magictree.cpp:62:33: error: 'class std::unordered_map<long long int, long long int>' has no member named 'upper_bound'
62 | auto it = dp[u].upper_bound(fruits[u][0].first);
| ^~~~~~~~~~~
