# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492807 | 2021-12-09T02:47:17 Z | ntabc05101 | Museum (CEOI17_museum) | C++14 | 601 ms | 1048580 KB |
#include<bits/stdc++.h> using namespace std; #define taskname "" const long long inf = 1e18; const int mxN = 10002; int n, k, x; vector< pair<int, int> > adj[mxN]; int sz[mxN]; long long dp[mxN][mxN][2]; void dfs(int u, int p = -1) { sz[u] = 1; for (int i = 2; i <= k; i++) { dp[u][i][0] = dp[u][i][1] = inf; } vector<long long> res(1, 0); for (auto &to: adj[u]) { if (to.first != p) { dfs(to.first, u); for (int i = min(sz[u] + sz[to.first], k); i > 1; i--) { for (int j = min(sz[to.first] , i - 1); j >= max(1, i - sz[u]); j--) { dp[u][i][1] = min({dp[u][i][1], dp[u][i - j][1] + dp[to.first][j][0] + (to.second << 1), dp[u][i - j][0] + dp[to.first][j][1] + to.second}); dp[u][i][0] = min({dp[u][i][0], dp[u][i - j][0] + dp[to.first][j][0] + (to.second << 1)}); } } sz[u] += sz[to.first]; } } } int main() { if (fopen(taskname".inp", "r")) { freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } else { if (fopen(taskname".in", "r")) { freopen(taskname".in", "r", stdin); freopen(taskname".out", "w", stdout); } } cin.tie(0)->sync_with_stdio(0); cin >> n >> k >> x; x--; for (int i = 0, x, y, w; i < n - 1; i++) { cin >> x >> y >> w; x--; y--; adj[x].push_back({y, w}); adj[y].push_back({x, w}); } dfs(x); cout << dp[x][k][1] << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 588 KB | Output is correct |
2 | Correct | 1 ms | 588 KB | Output is correct |
3 | Correct | 1 ms | 588 KB | Output is correct |
4 | Correct | 1 ms | 564 KB | Output is correct |
5 | Correct | 1 ms | 560 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 59460 KB | Output is correct |
2 | Correct | 33 ms | 59404 KB | Output is correct |
3 | Correct | 35 ms | 59916 KB | Output is correct |
4 | Correct | 43 ms | 59332 KB | Output is correct |
5 | Correct | 36 ms | 59072 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 59460 KB | Output is correct |
2 | Correct | 33 ms | 59404 KB | Output is correct |
3 | Correct | 35 ms | 59916 KB | Output is correct |
4 | Correct | 43 ms | 59332 KB | Output is correct |
5 | Correct | 36 ms | 59072 KB | Output is correct |
6 | Correct | 33 ms | 59480 KB | Output is correct |
7 | Correct | 40 ms | 59828 KB | Output is correct |
8 | Correct | 37 ms | 59504 KB | Output is correct |
9 | Correct | 38 ms | 59408 KB | Output is correct |
10 | Correct | 33 ms | 59468 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 588 KB | Output is correct |
2 | Correct | 1 ms | 588 KB | Output is correct |
3 | Correct | 1 ms | 588 KB | Output is correct |
4 | Correct | 1 ms | 564 KB | Output is correct |
5 | Correct | 1 ms | 560 KB | Output is correct |
6 | Correct | 34 ms | 59460 KB | Output is correct |
7 | Correct | 33 ms | 59404 KB | Output is correct |
8 | Correct | 35 ms | 59916 KB | Output is correct |
9 | Correct | 43 ms | 59332 KB | Output is correct |
10 | Correct | 36 ms | 59072 KB | Output is correct |
11 | Correct | 33 ms | 59480 KB | Output is correct |
12 | Correct | 40 ms | 59828 KB | Output is correct |
13 | Correct | 37 ms | 59504 KB | Output is correct |
14 | Correct | 38 ms | 59408 KB | Output is correct |
15 | Correct | 33 ms | 59468 KB | Output is correct |
16 | Correct | 105 ms | 200080 KB | Output is correct |
17 | Correct | 506 ms | 825012 KB | Output is correct |
18 | Correct | 123 ms | 200224 KB | Output is correct |
19 | Correct | 145 ms | 200076 KB | Output is correct |
20 | Correct | 123 ms | 200052 KB | Output is correct |
21 | Runtime error | 601 ms | 1048580 KB | Execution killed with signal 9 |
22 | Halted | 0 ms | 0 KB | - |