oj.uz

답안 #561728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561728 2022-05-13T12:10:19 Z piOOE 도로 폐쇄 (APIO21_roads) C++17
53 / 100
 570 ms 33512 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 - 1];
            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
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 362 ms 5308 KB Output is correct
3 Correct 406 ms 5324 KB Output is correct
4 Correct 303 ms 5332 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 6 ms 4948 KB Output is correct
8 Correct 231 ms 5268 KB Output is correct
9 Correct 344 ms 5308 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 6 ms 4948 KB Output is correct
12 Correct 27 ms 7512 KB Output is correct
13 Correct 42 ms 10268 KB Output is correct
14 Correct 46 ms 10616 KB Output is correct
15 Correct 51 ms 11200 KB Output is correct
16 Correct 53 ms 11252 KB Output is correct
17 Correct 47 ms 11384 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 55 ms 15120 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 58 ms 28608 KB Output is correct
3 Correct 65 ms 31744 KB Output is correct
4 Correct 72 ms 33484 KB Output is correct
5 Correct 68 ms 33448 KB Output is correct
6 Correct 328 ms 5480 KB Output is correct
7 Correct 440 ms 5460 KB Output is correct
8 Correct 369 ms 5500 KB Output is correct
9 Correct 7 ms 4948 KB Output is correct
10 Correct 6 ms 4948 KB Output is correct
11 Correct 7 ms 5064 KB Output is correct
12 Correct 38 ms 22084 KB Output is correct
13 Correct 61 ms 33512 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 59 ms 22396 KB Output is correct
16 Correct 75 ms 24260 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 6 ms 4948 KB Output is correct
5 Correct 8 ms 5040 KB Output is correct
6 Correct 7 ms 5076 KB Output is correct
7 Correct 7 ms 4948 KB Output is correct
8 Correct 8 ms 5036 KB Output is correct
9 Correct 10 ms 5036 KB Output is correct
10 Correct 7 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 8 ms 5060 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 8 ms 4948 KB Output is correct
18 Correct 7 ms 4948 KB Output is correct
19 Correct 6 ms 5044 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 6 ms 4948 KB Output is correct
5 Correct 8 ms 5040 KB Output is correct
6 Correct 7 ms 5076 KB Output is correct
7 Correct 7 ms 4948 KB Output is correct
8 Correct 8 ms 5036 KB Output is correct
9 Correct 10 ms 5036 KB Output is correct
10 Correct 7 ms 4948 KB Output is correct
11 Correct 7 ms 4948 KB Output is correct
12 Correct 8 ms 5060 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 8 ms 4948 KB Output is correct
18 Correct 7 ms 4948 KB Output is correct
19 Correct 6 ms 5044 KB Output is correct
20 Correct 6 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 213 ms 5168 KB Output is correct
24 Correct 570 ms 5280 KB Output is correct
25 Correct 406 ms 5204 KB Output is correct
26 Correct 448 ms 5268 KB Output is correct
27 Correct 375 ms 5312 KB Output is correct
28 Correct 303 ms 5292 KB Output is correct
29 Correct 456 ms 5204 KB Output is correct
30 Correct 363 ms 5204 KB Output is correct
31 Correct 383 ms 5272 KB Output is correct
32 Correct 307 ms 5296 KB Output is correct
33 Correct 337 ms 5480 KB Output is correct
34 Correct 457 ms 5460 KB Output is correct
35 Correct 358 ms 5460 KB Output is correct
36 Correct 341 ms 5328 KB Output is correct
37 Correct 408 ms 5324 KB Output is correct
38 Correct 293 ms 5320 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 5032 KB Output is correct
42 Correct 9 ms 5040 KB Output is correct
43 Correct 6 ms 4948 KB Output is correct
44 Correct 7 ms 4948 KB Output is correct
45 Correct 9 ms 4948 KB Output is correct
46 Correct 7 ms 4948 KB Output is correct
47 Correct 6 ms 5056 KB Output is correct
48 Correct 7 ms 4948 KB Output is correct
49 Correct 8 ms 4948 KB Output is correct
50 Correct 5 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 334 ms 5212 KB Output is correct
54 Correct 563 ms 5280 KB Output is correct
55 Correct 358 ms 5300 KB Output is correct
56 Correct 231 ms 5268 KB Output is correct
57 Correct 337 ms 5308 KB Output is correct
58 Correct 4 ms 4948 KB Output is correct
59 Correct 9 ms 4948 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 4948 KB Output is correct
63 Correct 2 ms 4948 KB Output is correct
64 Correct 4 ms 5208 KB Output is correct
65 Correct 4 ms 5204 KB Output is correct
66 Correct 4 ms 5204 KB Output is correct
67 Correct 5 ms 5204 KB Output is correct
68 Correct 4 ms 5204 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 14404 KB Output is correct
2 Correct 78 ms 14300 KB Output is correct
3 Correct 65 ms 15272 KB Output is correct
4 Correct 80 ms 14664 KB Output is correct
5 Correct 63 ms 15308 KB Output is correct
6 Correct 62 ms 15020 KB Output is correct
7 Correct 70 ms 14884 KB Output is correct
8 Correct 55 ms 14404 KB Output is correct
9 Correct 78 ms 17596 KB Output is correct
10 Correct 70 ms 14480 KB Output is correct
11 Correct 66 ms 15176 KB Output is correct
12 Correct 60 ms 14988 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 57 ms 22344 KB Output is correct
15 Correct 62 ms 24220 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 3 ms 5204 KB Output is correct
20 Correct 4 ms 5204 KB Output is correct
21 Correct 58 ms 14304 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 14404 KB Output is correct
2 Correct 78 ms 14300 KB Output is correct
3 Correct 65 ms 15272 KB Output is correct
4 Correct 80 ms 14664 KB Output is correct
5 Correct 63 ms 15308 KB Output is correct
6 Correct 62 ms 15020 KB Output is correct
7 Correct 70 ms 14884 KB Output is correct
8 Correct 55 ms 14404 KB Output is correct
9 Correct 78 ms 17596 KB Output is correct
10 Correct 70 ms 14480 KB Output is correct
11 Correct 66 ms 15176 KB Output is correct
12 Correct 60 ms 14988 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 57 ms 22344 KB Output is correct
15 Correct 62 ms 24220 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 3 ms 5204 KB Output is correct
20 Correct 4 ms 5204 KB Output is correct
21 Correct 58 ms 14304 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Incorrect 73 ms 16596 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 362 ms 5308 KB Output is correct
3 Correct 406 ms 5324 KB Output is correct
4 Correct 303 ms 5332 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 6 ms 4948 KB Output is correct
8 Correct 231 ms 5268 KB Output is correct
9 Correct 344 ms 5308 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 6 ms 4948 KB Output is correct
12 Correct 27 ms 7512 KB Output is correct
13 Correct 42 ms 10268 KB Output is correct
14 Correct 46 ms 10616 KB Output is correct
15 Correct 51 ms 11200 KB Output is correct
16 Correct 53 ms 11252 KB Output is correct
17 Correct 47 ms 11384 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 55 ms 15120 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 58 ms 28608 KB Output is correct
22 Correct 65 ms 31744 KB Output is correct
23 Correct 72 ms 33484 KB Output is correct
24 Correct 68 ms 33448 KB Output is correct
25 Correct 328 ms 5480 KB Output is correct
26 Correct 440 ms 5460 KB Output is correct
27 Correct 369 ms 5500 KB Output is correct
28 Correct 7 ms 4948 KB Output is correct
29 Correct 6 ms 4948 KB Output is correct
30 Correct 7 ms 5064 KB Output is correct
31 Correct 38 ms 22084 KB Output is correct
32 Correct 61 ms 33512 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 59 ms 22396 KB Output is correct
35 Correct 75 ms 24260 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 6 ms 4948 KB Output is correct
40 Correct 8 ms 5040 KB Output is correct
41 Correct 7 ms 5076 KB Output is correct
42 Correct 7 ms 4948 KB Output is correct
43 Correct 8 ms 5036 KB Output is correct
44 Correct 10 ms 5036 KB Output is correct
45 Correct 7 ms 4948 KB Output is correct
46 Correct 7 ms 4948 KB Output is correct
47 Correct 8 ms 5060 KB Output is correct
48 Correct 4 ms 4948 KB Output is correct
49 Correct 6 ms 4948 KB Output is correct
50 Correct 6 ms 4948 KB Output is correct
51 Correct 4 ms 4948 KB Output is correct
52 Correct 8 ms 4948 KB Output is correct
53 Correct 7 ms 4948 KB Output is correct
54 Correct 6 ms 5044 KB Output is correct
55 Correct 6 ms 4948 KB Output is correct
56 Correct 3 ms 4948 KB Output is correct
57 Correct 3 ms 4948 KB Output is correct
58 Correct 213 ms 5168 KB Output is correct
59 Correct 570 ms 5280 KB Output is correct
60 Correct 406 ms 5204 KB Output is correct
61 Correct 448 ms 5268 KB Output is correct
62 Correct 375 ms 5312 KB Output is correct
63 Correct 303 ms 5292 KB Output is correct
64 Correct 456 ms 5204 KB Output is correct
65 Correct 363 ms 5204 KB Output is correct
66 Correct 383 ms 5272 KB Output is correct
67 Correct 307 ms 5296 KB Output is correct
68 Correct 337 ms 5480 KB Output is correct
69 Correct 457 ms 5460 KB Output is correct
70 Correct 358 ms 5460 KB Output is correct
71 Correct 341 ms 5328 KB Output is correct
72 Correct 408 ms 5324 KB Output is correct
73 Correct 293 ms 5320 KB Output is correct
74 Correct 3 ms 4948 KB Output is correct
75 Correct 3 ms 4948 KB Output is correct
76 Correct 6 ms 5032 KB Output is correct
77 Correct 9 ms 5040 KB Output is correct
78 Correct 6 ms 4948 KB Output is correct
79 Correct 7 ms 4948 KB Output is correct
80 Correct 9 ms 4948 KB Output is correct
81 Correct 7 ms 4948 KB Output is correct
82 Correct 6 ms 5056 KB Output is correct
83 Correct 7 ms 4948 KB Output is correct
84 Correct 8 ms 4948 KB Output is correct
85 Correct 5 ms 4948 KB Output is correct
86 Correct 6 ms 4948 KB Output is correct
87 Correct 6 ms 4948 KB Output is correct
88 Correct 334 ms 5212 KB Output is correct
89 Correct 563 ms 5280 KB Output is correct
90 Correct 358 ms 5300 KB Output is correct
91 Correct 231 ms 5268 KB Output is correct
92 Correct 337 ms 5308 KB Output is correct
93 Correct 4 ms 4948 KB Output is correct
94 Correct 9 ms 4948 KB Output is correct
95 Correct 7 ms 4948 KB Output is correct
96 Correct 6 ms 4948 KB Output is correct
97 Correct 6 ms 4948 KB Output is correct
98 Correct 2 ms 4948 KB Output is correct
99 Correct 4 ms 5208 KB Output is correct
100 Correct 4 ms 5204 KB Output is correct
101 Correct 4 ms 5204 KB Output is correct
102 Correct 5 ms 5204 KB Output is correct
103 Correct 4 ms 5204 KB Output is correct
104 Correct 89 ms 14404 KB Output is correct
105 Correct 78 ms 14300 KB Output is correct
106 Correct 65 ms 15272 KB Output is correct
107 Correct 80 ms 14664 KB Output is correct
108 Correct 63 ms 15308 KB Output is correct
109 Correct 62 ms 15020 KB Output is correct
110 Correct 70 ms 14884 KB Output is correct
111 Correct 55 ms 14404 KB Output is correct
112 Correct 78 ms 17596 KB Output is correct
113 Correct 70 ms 14480 KB Output is correct
114 Correct 66 ms 15176 KB Output is correct
115 Correct 60 ms 14988 KB Output is correct
116 Correct 3 ms 4948 KB Output is correct
117 Correct 57 ms 22344 KB Output is correct
118 Correct 62 ms 24220 KB Output is correct
119 Correct 6 ms 5204 KB Output is correct
120 Correct 4 ms 5204 KB Output is correct
121 Correct 5 ms 5204 KB Output is correct
122 Correct 3 ms 5204 KB Output is correct
123 Correct 4 ms 5204 KB Output is correct
124 Correct 58 ms 14304 KB Output is correct
125 Correct 3 ms 4948 KB Output is correct
126 Correct 3 ms 4948 KB Output is correct
127 Correct 3 ms 4948 KB Output is correct
128 Incorrect 73 ms 16596 KB Output isn't correct
129 Halted 0 ms 0 KB -