이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<vector<int>> child(n);
vector par(n, -1);
for (int i = 1; i < n; i++) {
cin >> par[i];
child[--par[i]].push_back(i);
}
vector<pair<int,int>> fruit(n);
for (int i =0; i < m;i ++) {
int v, d, w;
cin >> v >> d >> w;
v--;
fruit[v] = {d, w};
}
vector memo(n, vector(k+1, -1ll));
auto dp = [&](auto& dp, int i, int day)->ll{
if (day == 0) return 0;
if (memo[i][day] !=-1) return memo[i][day];
ll res1 = 0ll;
if (fruit[i].first == day) res1 += fruit[i].second;
for (int e : child[i]) {
res1 += dp(dp, e, day);
}
res1 = max(res1, dp(dp, i, day-1));
return memo[i][day] = res1;
};
cout << dp(dp, 0, k) << '\n';
}
# | 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... |