# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981637 | 2024-05-13T11:58:30 Z | Ghulam_Junaid | Road Closures (APIO21_roads) | C++17 | 40 ms | 4956 KB |
#include <bits/stdc++.h> #include "roads.h" using namespace std; typedef long long ll; vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) { int n = N; vector<ll> ans(n, 0); bool subtask1 = 1, subtask2 = 1; for (int i = 0; i < n - 1; i ++){ subtask1 &= (U[i] == 0); subtask2 &= (U[i] == i and V[i] == i + 1); } ll sm = 0; for (int i = 0; i < n - 1; i ++) sm += W[i]; ans[0] = sm; if (subtask1){ sort(W.begin(), W.end()); for (int i = 1; i < n; i ++) ans[i] = ans[i - 1] - W[n - i - 1]; } if (subtask2){ ll dp[n][2]; dp[0][0] = W[0]; dp[0][1] = 0; for (int i = 1; i < W.size(); i ++){ dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + W[i]; dp[i][1] = dp[i - 1][0]; } ans[1] = min(dp[W.size() - 1][0], dp[W.size() - 1][1]); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 344 KB | Output is correct |
12 | Correct | 23 ms | 2140 KB | Output is correct |
13 | Correct | 31 ms | 3420 KB | Output is correct |
14 | Correct | 36 ms | 3392 KB | Output is correct |
15 | Correct | 40 ms | 3780 KB | Output is correct |
16 | Correct | 40 ms | 3668 KB | Output is correct |
17 | Correct | 35 ms | 3772 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 27 ms | 3056 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 27 ms | 4184 KB | Output is correct |
3 | Correct | 31 ms | 4696 KB | Output is correct |
4 | Correct | 32 ms | 4956 KB | Output is correct |
5 | Correct | 33 ms | 4952 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 18 ms | 3164 KB | Output is correct |
13 | Correct | 30 ms | 4956 KB | Output is correct |
14 | Correct | 0 ms | 348 KB | Output is correct |
15 | Correct | 27 ms | 4572 KB | Output is correct |
16 | Correct | 30 ms | 4956 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 28 ms | 3416 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 28 ms | 3416 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 344 KB | Output is correct |
12 | Correct | 23 ms | 2140 KB | Output is correct |
13 | Correct | 31 ms | 3420 KB | Output is correct |
14 | Correct | 36 ms | 3392 KB | Output is correct |
15 | Correct | 40 ms | 3780 KB | Output is correct |
16 | Correct | 40 ms | 3668 KB | Output is correct |
17 | Correct | 35 ms | 3772 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 27 ms | 3056 KB | Output is correct |
20 | Correct | 0 ms | 344 KB | Output is correct |
21 | Correct | 27 ms | 4184 KB | Output is correct |
22 | Correct | 31 ms | 4696 KB | Output is correct |
23 | Correct | 32 ms | 4956 KB | Output is correct |
24 | Correct | 33 ms | 4952 KB | Output is correct |
25 | Correct | 1 ms | 348 KB | Output is correct |
26 | Correct | 1 ms | 348 KB | Output is correct |
27 | Correct | 1 ms | 348 KB | Output is correct |
28 | Correct | 1 ms | 348 KB | Output is correct |
29 | Correct | 0 ms | 348 KB | Output is correct |
30 | Correct | 0 ms | 348 KB | Output is correct |
31 | Correct | 18 ms | 3164 KB | Output is correct |
32 | Correct | 30 ms | 4956 KB | Output is correct |
33 | Correct | 0 ms | 348 KB | Output is correct |
34 | Correct | 27 ms | 4572 KB | Output is correct |
35 | Correct | 30 ms | 4956 KB | Output is correct |
36 | Correct | 0 ms | 348 KB | Output is correct |
37 | Incorrect | 0 ms | 348 KB | Output isn't correct |
38 | Halted | 0 ms | 0 KB | - |