# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1236059 | badge881 | Magic Tree (CEOI19_magictree) | C++20 | 68 ms | 49476 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, m, k;
scanf("%lld%lld%lld", &n, &m, &k);
vector<ll> g[n + 5];
ll p[n + 5];
for (ll i = 2; i <= n; i++)
{
scanf("%lld", &p[i]);
g[p[i]].push_back(i);
}
ll u[m], d[m], w[m];
vector<ll> day(n + 5, 0), pt(n + 5, 0);
for (ll i = 0; i < m; i++)
{
scanf("%lld%lld%lld", &u[i], &d[i], &w[i]);
day[u[i]] = d[i];
pt[u[i]] = w[i];
}
if (k <= 20)
{
ll dp[n + 5][k + 5], pre[n + 5][k + 5];
memset(dp, 0, sizeof (dp));
memset(pre, 0, sizeof (pre));
for (ll i = n; i >= 1; i--)
{
for (ll j = 1; j <= k; j++)
{
for (ll x : g[i])
{
dp[i][j] += pre[x][j];
}
if (day[i] == j)
{
dp[i][j] += pt[i];
}
}
for (ll j = 1; j <= k; j++)
pre[i][j] = max(dp[i][j], pre[i][j - 1]);
}
printf("%d", pre[1][k]);
}
}
컴파일 시 표준 에러 (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... |