oj.uz

Submission #561629

# Submission time Handle Problem Language Result Execution time Memory
561629 2022-05-13T09:10:45 Z piOOE Road Closures (APIO21_roads) C++17
24 / 100
 372 ms 5124 KB 
#include "roads.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)

typedef long long ll;

const int N = 2001;
int A[N], B[N], W[N], n;
ll dp[N][2];
int k;
vector <pair<int, int>> g[N];

void dfs(int v, int p) {
    vector<pair<int, int>> adj;
    for (auto [to, w]: g[v]) {
        if (to != p) {
            dfs(to, v);
            adj.emplace_back(to, w);
        }
    }
    if (k > (int) size(adj)) {
        vector<ll> nw;
        ll ans = 0;
        for (auto [to, w]: adj) {
            ans += dp[to][0] + w;
            nw.push_back(dp[to][1] - dp[to][0] - w);
        }
        sort(all(nw));
        for (int i = 0; i < (int) size(nw); ++i) {
            if (nw[i] < 0)
                ans += nw[i];
        }
        dp[v][1] = dp[v][0] = ans;
    } else {
        vector<ll> nw;
        ll ans = 0;
        for (auto [to, w]: adj) {
            ans += dp[to][0] + w;
            nw.push_back(dp[to][1] - dp[to][0] - w);
        }
        sort(all(nw));
        ll added = 0;
        for (int i = 0; i < k - 1; ++i) {
            if (nw[i] < 0)
                added += nw[i];
        }
        dp[v][1] = ans + added;
        added = 0;
        for (int i = 0; i < k; ++i) {
            added += nw[i];
        }
        dp[v][0] = min(dp[v][1], ans + added);
    }
}

vector <ll> minimum_closure_costs(int nn, vector<int> uu, vector<int> vv, vector<int> ww) {
    n = nn;
    for (int i = 0; i < n - 1; ++i) {
        A[i] = uu[i], B[i] = vv[i], W[i] = ww[i];
        g[A[i]].emplace_back(B[i], W[i]);
        g[B[i]].emplace_back(A[i], W[i]);
    }
    vector<ll> ans;
    for (k = 0; k < n; ++k) {
        dfs(0, -1);
        ans.push_back(dp[0][0]);
    }
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 183 ms 688 KB Output is correct
3 Correct 188 ms 568 KB Output is correct
4 Correct 78 ms 588 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 87 ms 560 KB Output is correct
9 Correct 120 ms 588 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Runtime error 17 ms 3372 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Runtime error 27 ms 4820 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 360 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 352 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 352 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 4 ms 360 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 352 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2 ms 352 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 134 ms 508 KB Output is correct
24 Correct 372 ms 572 KB Output is correct
25 Correct 249 ms 520 KB Output is correct
26 Correct 245 ms 560 KB Output is correct
27 Correct 186 ms 608 KB Output is correct
28 Correct 89 ms 588 KB Output is correct
29 Correct 285 ms 560 KB Output is correct
30 Correct 149 ms 580 KB Output is correct
31 Correct 171 ms 588 KB Output is correct
32 Correct 87 ms 584 KB Output is correct
33 Correct 174 ms 808 KB Output is correct
34 Correct 226 ms 852 KB Output is correct
35 Correct 226 ms 824 KB Output is correct
36 Correct 154 ms 596 KB Output is correct
37 Correct 188 ms 732 KB Output is correct
38 Correct 113 ms 600 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 3 ms 340 KB Output is correct
45 Correct 3 ms 340 KB Output is correct
46 Correct 3 ms 340 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 3 ms 340 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 229 ms 516 KB Output is correct
54 Correct 347 ms 572 KB Output is correct
55 Correct 134 ms 584 KB Output is correct
56 Correct 88 ms 580 KB Output is correct
57 Correct 117 ms 596 KB Output is correct
58 Correct 2 ms 340 KB Output is correct
59 Correct 4 ms 340 KB Output is correct
60 Correct 3 ms 340 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 1 ms 356 KB Output is correct
63 Correct 1 ms 356 KB Output is correct
64 Correct 334 ms 564 KB Output is correct
65 Correct 349 ms 676 KB Output is correct
66 Correct 124 ms 596 KB Output is correct
67 Correct 92 ms 572 KB Output is correct
68 Correct 124 ms 568 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 5124 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 5124 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 183 ms 688 KB Output is correct
3 Correct 188 ms 568 KB Output is correct
4 Correct 78 ms 588 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 87 ms 560 KB Output is correct
9 Correct 120 ms 588 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Runtime error 17 ms 3372 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -