-
Notifications
You must be signed in to change notification settings - Fork 1
/
P3408.cc
59 lines (54 loc) · 1.28 KB
/
P3408.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <set>
#include <queue>
using namespace std;
#define DIV_ROUND_UP(X, Y) ((X+Y-1) / (Y))
#define MAXN 500000
typedef long long ll;
int a[MAXN + 1], fa[MAXN + 1], num_children[MAXN + 1], ok_num[MAXN + 1];
ll dp[MAXN + 1];
multiset<ll> s[MAXN + 1];
queue<int> q;
int main() {
int n, t, c;
cin >> n >> t >> c;
a[0] = c;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &fa[i], &a[i]);
num_children[fa[i]]++;
}
for (int i = 0; i <= n; i++) {
if (num_children[i] == 0) {
dp[i] = a[i];
q.push(i);
}
else {
ll tmp = (ll)a[i] * (ll)num_children[i];
ok_num[i] = (int)DIV_ROUND_UP(tmp, t);
}
}
while (!q.empty()) {
int node = q.front();
q.pop();
if (dp[node] == 0) {
auto it = s[node].begin();
while (ok_num[node]--) {
dp[node] += *it;
it++;
}
s[node].clear();
}
if (node == 0) {
break;
}
int father = fa[node];
s[father].insert(dp[node]);
if (--num_children[father] == 0) {
q.push(father);
}
}
cout << dp[0] << endl;
exit(0);
}