# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83374 | 2018-11-07T12:40:25 Z | charlies_moo | Dostavljač (COCI18_dostavljac) | C++17 | 277 ms | 2548 KB |
#include <cstdio> #include <cstring> #include <vector> #include <algorithm> using namespace std; const int N = 500; const int M = 500; typedef vector<int> vi; int dp1[N][M+1], dp2[N][M+1]; void dfs(vi e[], int a[], int x, int p, int m) { for (int i = 1; i <= m; i++) { dp1[x][i] = dp2[x][i] = a[x]; } for (int i = 0; i < e[x].size(); i++) { if (e[x][i] == p) { continue; } dfs(e, a, e[x][i], x, m); for (int j = m; j >= 0; j--) { for (int k = 0; k <= j - 1; k++) { if (j - k - 2 >= 0) { dp1[x][j] = max(dp1[x][j], dp1[x][j-k-2] + dp1[e[x][i]][k]); } dp2[x][j] = max(dp2[x][j], dp1[x][j-k-1] + dp2[e[x][i]][k]); } } } } int main() { int n, m; scanf("%d %d", &n, &m); int a[n]; for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } vi e[n]; for (int i = 0; i < n - 1; i++) { int u, v; scanf("%d %d", &u, &v); u--, v--; e[u].push_back(v); e[v].push_back(u); } dfs(e, a, 0, -1, m); printf("%d\n", dp2[0][m]); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 500 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 708 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 740 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 888 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1092 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 62 ms | 1392 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 24 ms | 1772 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 172 ms | 2256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 277 ms | 2548 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |