# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120151 | 2019-06-23T15:08:46 Z | luciocf | Dostavljač (COCI18_dostavljac) | C++14 | 237 ms | 2448 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 510; int n, m; int A[maxn]; int dp[2][maxn][maxn]; vector<int> grafo[maxn]; void dfs(int u, int p) { for (int i = 1; i <= m; i++) dp[0][u][i] = dp[1][u][i] = A[u]; for (auto v: grafo[u]) { if (v == p) continue; dfs(v, u); for (int i = m; i >= 1; i--) { for (int j = 0; j <= i; j++) { if (i >= j+1) dp[0][u][i] = max(dp[0][u][i], max(dp[0][v][j], dp[1][v][j]) + dp[1][u][i-j-1]); if (i >= j+2) dp[1][u][i] = max(dp[1][u][i], dp[1][v][j] + max(dp[0][u][i-j-2], dp[1][u][i-j-2])); } } } } int main(void) { scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) scanf("%d", &A[i]); for (int i = 1; i < n; i++) { int u, v; scanf("%d %d", &u, &v); grafo[u].push_back(v); grafo[v].push_back(u); } dfs(1, 0); printf("%d\n", max(dp[0][1][m], dp[1][1][m])); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 512 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 512 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 640 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 768 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 868 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 62 ms | 1184 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 24 ms | 1508 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 122 ms | 2008 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 237 ms | 2448 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |