oj.uz

Submission #561727

# Submission time Handle Problem Language Result Execution time Memory
561727 2022-05-13T12:09:05 Z piOOE Road Closures (APIO21_roads) C++17
48 / 100
 590 ms 33708 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 = 100001;
int A[N], B[N], W[N], n;
vector<int> gr[N];
vector<pair<int, int>> g[N];

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];
    }
    vector<ll> ans(n);
    if (*max_element(all(W)) == 1) {
        vector<int> pp(n), cnt(n), depth(n);
        vector<bool> used(n);
        function<void(int, int)> dfs = [&](int v, int p) {
            pp[v] = p;
            for (int to: gr[v]) {
                if (to != p) {
                    depth[to] = depth[v] + 1;
                    dfs(to, v);
                }
            }
        };
        for (int i = 0; i < n - 1; ++i) {
            gr[A[i]].push_back(B[i]);
            gr[B[i]].push_back(A[i]);
        }
        vector<int> ord(n);
        iota(all(ord), 0);
        sort(all(ord), [](int i, int j) {
            return gr[i].size() > gr[j].size();
        });
        dfs(0, -1);
        for (int k = 0; k < n; ++k) {
            vector<int> now;
            for (int i: ord) {
                if (gr[i].size() <= k) break;
                now.push_back(i);
                used[i] = true;
                cnt[i] = (int) gr[i].size();
            }
            sort(all(now), [&depth](int i, int j) {
                return depth[i] > depth[j];
            });
            for (int i: now) {
                if (pp[i] != -1 && used[pp[i]] && cnt[i] > k) {
                    --cnt[pp[i]];
                    --cnt[i];
                    ++ans[k];
                }
            }
            for (int i: now) {
                ans[k] += max(0, cnt[i] - k);
                used[i] = false;
            }
        }
        return ans;
    } else if (n <= 2000) {
        for (int i = 0; i < n - 1; ++i) {
            g[A[i]].emplace_back(B[i], W[i]);
            g[B[i]].emplace_back(A[i], W[i]);
        }
        for (int k = 0; k < n; ++k) {
            vector<vector<ll>> dp(n + 1, vector<ll>(2));
            function<void(int, int)> 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);
                }
            };
            dfs(0, -1);
            ans[k] = dp[0][0];
        }
        return ans;
    } else if (*max_element(all(A)) == 0) {
        sort(W, W + n - 1);
        ll nw = 0;
        ll sum = accumulate(all(W), 0ll);
        for (int k = 0; k < n; ++k) {
            if (k) nw += W[n - k];
            ans[k] = sum - nw;
        }
        return ans;
    } else {
        for (int i = 0; i < n - 1; ++i) {
            g[A[i]].emplace_back(B[i], W[i]);
            g[B[i]].emplace_back(A[i], W[i]);
        }
        ans[0] = accumulate(all(W), 0ll);
        for (int k = 1; k <= 1; ++k) {
            vector<vector<ll>> dp(n + 1, vector<ll>(2));
            function<void(int, int)> 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);
                }
            };
            dfs(0, -1);
            ans[k] = dp[0][0];
        }
        for (int k = 2; k < n; ++k) {
            ans[k] = 0;
        }
        return ans;
    }
}

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:47:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |                 if (gr[i].size() <= k) break;
      |                     ~~~~~~~~~~~~~^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 352 ms 5300 KB Output is correct
3 Correct 462 ms 5312 KB Output is correct
4 Correct 312 ms 5324 KB Output is correct
5 Correct 5 ms 4948 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 5 ms 4948 KB Output is correct
8 Correct 241 ms 5272 KB Output is correct
9 Correct 343 ms 5312 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 5 ms 4948 KB Output is correct
12 Incorrect 25 ms 7520 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 59 ms 28640 KB Output is correct
3 Correct 64 ms 31892 KB Output is correct
4 Correct 72 ms 33708 KB Output is correct
5 Correct 69 ms 33616 KB Output is correct
6 Correct 333 ms 5512 KB Output is correct
7 Correct 441 ms 5588 KB Output is correct
8 Correct 360 ms 5540 KB Output is correct
9 Correct 6 ms 5000 KB Output is correct
10 Correct 7 ms 4948 KB Output is correct
11 Correct 8 ms 5004 KB Output is correct
12 Correct 39 ms 22240 KB Output is correct
13 Correct 64 ms 33704 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 61 ms 22500 KB Output is correct
16 Correct 63 ms 24368 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 6 ms 4948 KB Output is correct
5 Correct 8 ms 5156 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 9 ms 4948 KB Output is correct
8 Correct 9 ms 4936 KB Output is correct
9 Correct 8 ms 4948 KB Output is correct
10 Correct 7 ms 4948 KB Output is correct
11 Correct 7 ms 5056 KB Output is correct
12 Correct 8 ms 5068 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 6 ms 4948 KB Output is correct
15 Correct 6 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 9 ms 4948 KB Output is correct
18 Correct 8 ms 4948 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 6 ms 5040 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 6 ms 4948 KB Output is correct
5 Correct 8 ms 5156 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 9 ms 4948 KB Output is correct
8 Correct 9 ms 4936 KB Output is correct
9 Correct 8 ms 4948 KB Output is correct
10 Correct 7 ms 4948 KB Output is correct
11 Correct 7 ms 5056 KB Output is correct
12 Correct 8 ms 5068 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 6 ms 4948 KB Output is correct
15 Correct 6 ms 4948 KB Output is correct
16 Correct 4 ms 4948 KB Output is correct
17 Correct 9 ms 4948 KB Output is correct
18 Correct 8 ms 4948 KB Output is correct
19 Correct 6 ms 4948 KB Output is correct
20 Correct 6 ms 5040 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4988 KB Output is correct
23 Correct 220 ms 5164 KB Output is correct
24 Correct 573 ms 5280 KB Output is correct
25 Correct 411 ms 5236 KB Output is correct
26 Correct 463 ms 5204 KB Output is correct
27 Correct 379 ms 5296 KB Output is correct
28 Correct 306 ms 5292 KB Output is correct
29 Correct 476 ms 5244 KB Output is correct
30 Correct 378 ms 5324 KB Output is correct
31 Correct 370 ms 5276 KB Output is correct
32 Correct 312 ms 5292 KB Output is correct
33 Correct 335 ms 5484 KB Output is correct
34 Correct 442 ms 5580 KB Output is correct
35 Correct 352 ms 5504 KB Output is correct
36 Correct 351 ms 5296 KB Output is correct
37 Correct 404 ms 5332 KB Output is correct
38 Correct 313 ms 5312 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 6 ms 5028 KB Output is correct
42 Correct 9 ms 5040 KB Output is correct
43 Correct 8 ms 4948 KB Output is correct
44 Correct 8 ms 4948 KB Output is correct
45 Correct 10 ms 5036 KB Output is correct
46 Correct 8 ms 4948 KB Output is correct
47 Correct 6 ms 4948 KB Output is correct
48 Correct 7 ms 5064 KB Output is correct
49 Correct 7 ms 4948 KB Output is correct
50 Correct 4 ms 4948 KB Output is correct
51 Correct 6 ms 4948 KB Output is correct
52 Correct 6 ms 4948 KB Output is correct
53 Correct 344 ms 5228 KB Output is correct
54 Correct 590 ms 5284 KB Output is correct
55 Correct 342 ms 5300 KB Output is correct
56 Correct 229 ms 5204 KB Output is correct
57 Correct 346 ms 5324 KB Output is correct
58 Correct 4 ms 4948 KB Output is correct
59 Correct 8 ms 5036 KB Output is correct
60 Correct 7 ms 4948 KB Output is correct
61 Correct 6 ms 4948 KB Output is correct
62 Correct 6 ms 5048 KB Output is correct
63 Correct 3 ms 4948 KB Output is correct
64 Correct 4 ms 5204 KB Output is correct
65 Correct 4 ms 5204 KB Output is correct
66 Correct 4 ms 5204 KB Output is correct
67 Correct 4 ms 5204 KB Output is correct
68 Correct 4 ms 5148 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 14456 KB Output is correct
2 Correct 77 ms 14312 KB Output is correct
3 Correct 64 ms 15320 KB Output is correct
4 Correct 89 ms 14628 KB Output is correct
5 Correct 61 ms 15308 KB Output is correct
6 Correct 62 ms 15056 KB Output is correct
7 Correct 76 ms 14920 KB Output is correct
8 Correct 55 ms 14400 KB Output is correct
9 Correct 78 ms 17592 KB Output is correct
10 Correct 71 ms 14504 KB Output is correct
11 Correct 66 ms 15176 KB Output is correct
12 Correct 62 ms 15016 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 60 ms 22340 KB Output is correct
15 Correct 68 ms 24216 KB Output is correct
16 Correct 4 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 55 ms 14312 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 14456 KB Output is correct
2 Correct 77 ms 14312 KB Output is correct
3 Correct 64 ms 15320 KB Output is correct
4 Correct 89 ms 14628 KB Output is correct
5 Correct 61 ms 15308 KB Output is correct
6 Correct 62 ms 15056 KB Output is correct
7 Correct 76 ms 14920 KB Output is correct
8 Correct 55 ms 14400 KB Output is correct
9 Correct 78 ms 17592 KB Output is correct
10 Correct 71 ms 14504 KB Output is correct
11 Correct 66 ms 15176 KB Output is correct
12 Correct 62 ms 15016 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 60 ms 22340 KB Output is correct
15 Correct 68 ms 24216 KB Output is correct
16 Correct 4 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 4 ms 5204 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 55 ms 14312 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Incorrect 76 ms 16532 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 352 ms 5300 KB Output is correct
3 Correct 462 ms 5312 KB Output is correct
4 Correct 312 ms 5324 KB Output is correct
5 Correct 5 ms 4948 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 5 ms 4948 KB Output is correct
8 Correct 241 ms 5272 KB Output is correct
9 Correct 343 ms 5312 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 5 ms 4948 KB Output is correct
12 Incorrect 25 ms 7520 KB Output isn't correct
13 Halted 0 ms 0 KB -