이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, k;
const int N = 100100;
int w[N];
int d[N];
int p[N];
int main() {
ios::sync_with_stdio(0),
cin.tie(0);
cin >> n >> m >> k;
for (int i = 2; i <= n; i++)
cin >> p[i];
for (int i = 0; i < m; i++) {
int u;
cin >> u;
cin >> d[u] >> w[u];
}
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
for (int i = n; i >= 1; i--) {
ll val = dp[i][d[i]] + w[i];
for (int j = d[i]; j <= k; j++)
dp[i][j] = max(dp[i][j], val);
for (int j = 1; j <= k; j++)
dp[p[i]][j] += dp[i][j];
}
cout << dp[1][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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |