#include<bits/stdc++.h>
//define endl '\n'
using namespace std;
const int MAXN = 2e5 + 10, MAXK = 20;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n, m, k;
int p[MAXN];
long long v[MAXN], d[MAXN], w[MAXN];
vector < int > g[MAXN];
pair < int, int > f[MAXN];
long long leaf[MAXN], total = 0;
long long a[MAXN];
void read()
{
cin >> n >> m >> k;
for (int i = 1; i <= n; ++ i)
leaf[i] = 1;
for (int i = 2; i <= n; ++ i)
{
cin >> p[i];
leaf[p[i]] = 0;
g[p[i]].push_back(i);
}
bool no = 0;
long long total = 0;
vector < int > diffw;
for (int i = 1; i <= m; ++ i)
{
cin >> v[i] >> d[i] >> w[i];
a[v[i]] = w[i];
if(!leaf[v[i]])no = 1;
total += w[i];
f[v[i]] = make_pair(d[i], w[i]);
}
if(!no)
{
cout << total << endl;
exit(0);
}
}
long long sub[MAXN][MAXK], dp[MAXN][MAXK], pref[MAXN][MAXK];
void dfs(int beg, int par)
{
int dd = f[beg].first;
if(dd)sub[beg][dd] += f[beg].second;
long long sum = 0;
for (auto nb: g[beg])
{
if(nb == par)continue;
dfs(nb, beg);
for (int i = 1; i <= k; ++ i)
sub[beg][i] += sub[nb][i];
}
for (int day = 1; day <= k; ++ day)
{
long long cost = 0;
if(day == dd)cost += f[beg].second;
long long sum = 0;
for (auto nb: g[beg])
cost += max(pref[nb][day], sub[nb][day]);
dp[beg][day] = max(dp[beg][day], cost);
pref[beg][day] = max(dp[beg][day], pref[beg][day-1]);
}
}
vector < int > vv;
void solve11()
{
vv.push_back(0);
for (int i = n; i >= 2; -- i)
{
int val = a[i];
if(!val)continue;
int sz = vv.size();
if(vv[sz-1] <= val)vv.push_back(val);
else
{
int l = 0, r = sz-1, mid, ans = sz-1;
while(l <= r)
{
mid = (l + r)/2;
if(vv[mid] <= val)l = mid + 1;
else
{
ans = mid;
r = mid - 1;
}
}
vv[mid] = val;
}
}
cout << vv.size() << endl;
}
int main()
{
speed();
read();
if(k <= 20)
{
long long ans = 0;
for (auto x: g[1])
{
dfs(x, 1);
ans = ans + pref[x][k];
}
cout << ans << endl;
return 0;
}
solve11();
return 0;
}
/***
7 5 2
1 2 2 1 4 4
2 2 1
3 2 1
4 1 1
6 1 1
5 1 10
6 5 10
1 2 2 1 1
2 2 8
3 5 6
4 5 7
5 10 1
6 10 1
*/
Compilation message
magictree.cpp: In function 'void dfs(int, int)':
magictree.cpp:65:19: warning: unused variable 'sum' [-Wunused-variable]
65 | long long sum = 0;
| ^~~
magictree.cpp:53:15: warning: unused variable 'sum' [-Wunused-variable]
53 | long long sum = 0;
| ^~~
magictree.cpp: In function 'void solve11()':
magictree.cpp:84:39: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
84 | int l = 0, r = sz-1, mid, ans = sz-1;
| ^~~
magictree.cpp:95:19: warning: 'mid' may be used uninitialized in this function [-Wmaybe-uninitialized]
95 | vv[mid] = val;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
16720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
16464 KB |
Output is correct |
| 2 |
Correct |
16 ms |
17728 KB |
Output is correct |
| 3 |
Correct |
28 ms |
16036 KB |
Output is correct |
| 4 |
Correct |
25 ms |
15824 KB |
Output is correct |
| 5 |
Correct |
29 ms |
16208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
14672 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
66 ms |
64840 KB |
Output is correct |
| 2 |
Correct |
66 ms |
66888 KB |
Output is correct |
| 3 |
Correct |
65 ms |
72008 KB |
Output is correct |
| 4 |
Correct |
47 ms |
65736 KB |
Output is correct |
| 5 |
Correct |
61 ms |
79156 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
16720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
15184 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
16720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
16720 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
16720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
