# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531426 | Killer2501 | Magic Tree (CEOI19_magictree) | C++14 | 2098 ms | 1048580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, ll>
#define fi first
#define se second
using namespace std;
const int N = 1e5+5;
const int M = 250;
const int mod = 1e9+7;
const ll base = 75;
const ll inf = 1e16;
int n, m, a[N], lab[N], b[N], tong, d[N], t, c[N], dp[N], k;
ll ans;
vector<int> adj[N], radj[N];
vector<pll> vi;
string s;
map<int, ll> mp[N];
void dfs(int u)
{
for(int v: adj[u])
{
dfs(v);
if(mp[v].empty())continue;
if(mp[u].size() > mp[v].size())swap(mp[u], mp[v]);
for(pii x: mp[v])mp[u][x.fi] += x.se;
}
if(b[u])
{
mp[u][b[u]] += a[u];
map<int, ll>:: iterator it = mp[u].upper_bound(b[u]), nxt;
for(; it != mp[u].end(); it = nxt)
{
if(a[u] < it->se)
{
it->se -= a[u];
nxt = next(it);
break;
}
else
{
a[u] -= it->se;
mp[u].erase(it);
}
}
}
/*
cout << u << " "<<b[u]<<" "<<a[u]<< '\n';
for(auto x: mp[u])cout << x.fi <<" "<<x.se<<'\n';
*/
}
void sol()
{
cin >> n >> m >> k;
for(int i = 2; i <= n; i ++)
{
cin >> t;
adj[t].pb(i);
}
for(int i = 1; i <= m; i ++)
{
cin >> t;
cin >> b[t] >> a[t];
}
dfs(1);
if(!mp[1].empty())for(pii x: mp[1])ans += x.se;
cout << ans;
}
int main()
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
#define task "test"
if(fopen(task".inp", "r"))
{
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int test = 1;
//cin >> test;
while(test -- > 0)sol();
return 0;
}
/*
1234
21
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |