oj.uz

Submission #528489

# Submission time Handle Problem Language Result Execution time Memory
528489 2022-02-20T11:18:08 Z cologne Road Closures (APIO21_roads) C++17
53 / 100
 288 ms 18864 KB 
#include "roads.h"

#include <algorithm>
#include <functional>
#include <utility>
#include <vector>
using namespace std;

vector<long long> st1(int N, vector<int> U, vector<int> V, vector<int> W)
{
    vector<long long> answer(N);
    sort(W.rbegin(), W.rend());
    for (int i = N - 1; i >= 1; --i)
        answer[i - 1] = answer[i] + W[i - 1];
    return answer;
}

vector<long long> st2(int N, vector<int> U, vector<int> V, vector<int> W)
{
    long long take = W[0], skip = 0, total = W[0];
    for (int i = 1; i < N - 1; i++)
    {
        long long new_take = min(take, skip) + W[i];
        long long new_skip = take;
        long long new_total = total + W[i];
        take = new_take, skip = new_skip, total = new_total;
    }
    vector<long long> answer(N);
    answer[0] = total;
    answer[1] = min(take, skip);
    return answer;
}

vector<long long> st3(int N, vector<int> U, vector<int> V, vector<int> W)
{
    vector<vector<pair<int, int>>> adj(N);
    vector<long long> answer(N);

    for (int i = 0; i < N - 1; i++)
    {
        adj[U[i]].emplace_back(V[i], W[i]);
        adj[V[i]].emplace_back(U[i], W[i]);
        answer[0] += W[i];
    }

    function<pair<long long, long long>(int, int, int)> dfs = [&](int a, int p, int k)
    {
        long long base = 0;
        vector<long long> save_cost;
        for (auto [x, w] : adj[a])
            if (x != p)
            {
                auto [lt, le] = dfs(x, a, k);
                long long pick = lt, no_pick = le + w;
                base += no_pick;
                save_cost.push_back(min(0LL, pick - no_pick));
            }
        sort(save_cost.begin(), save_cost.end());
        long long lt = base, le = base;
        for (int i = 0; i < (int)save_cost.size(); i++)
        {
            if (i < k - 1)
                lt += save_cost[i];
            if (i <= k - 1)
                le += save_cost[i];
        }
        return make_pair(lt, le);
    };

    for (int i = 1; i < N; i++)
        answer[i] = dfs(0, -1, i).second;

    return answer;
}

auto st4 = st3;

vector<long long> st5(int N, vector<int> U, vector<int> V, vector<int> W)
{
    vector<vector<int>> adj(N);
    vector<long long> answer(N);
    for (int i = 0; i < N - 1; i++)
    {
        adj[U[i]].push_back(V[i]);
        adj[V[i]].push_back(U[i]);
        answer[0] += W[i];
    }

    vector<vector<int>> targets(N);
    for (int i = 0; i < N; i++)
    {
        sort(adj[i].begin(), adj[i].end(), [&](int a, int b)
             { return adj[a].size() > adj[b].size(); });
        for (int j = 0; j < (int)adj[i].size(); j++)
            targets[j].push_back(i);
    }

    vector<bool> vis(N);
    for (int k = 1; k < N; k++)
    {

        function<pair<long long, long long>(int, int)> dfs = [&](int a, int p)
        {
            vis[a] = true;
            long long base = 0;
            vector<long long> save_cost;

            int leaf_count = (int)adj[a].size() - (p != -1);
            for (int x : adj[a])
            {
                if ((int)adj[x].size() < k)
                    break;
                if (x == p)
                    continue;
                leaf_count--;
                auto [lt, le] = dfs(x, a);
                long long pick = lt, no_pick = le + 1;
                base += no_pick;
                if (pick - no_pick < 0)
                    save_cost.push_back(pick - no_pick);
            }

            base += leaf_count;

            sort(save_cost.begin(), save_cost.end());
            long long lt = base, le = base;
            for (int i = 0; i < (int)save_cost.size(); i++)
            {
                if (i < k - 1)
                    lt += save_cost[i];
                if (i < k)
                    le += save_cost[i];
            }
            lt -= max(0, min((int)save_cost.size() + leaf_count, k - 1) - (int)save_cost.size());
            le -= max(0, min((int)save_cost.size() + leaf_count, k) - (int)save_cost.size());

            return make_pair(lt, le);
        };

        for (int u : targets[k])
            vis[u] = false;
        for (int u : targets[k])
            if (!vis[u])
                answer[k] += dfs(u, -1).second;
    }

    return answer;
}

#include <cassert>

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W)
{
    auto c1 = [&]()
    {
        for (int i = 0; i < N - 1; i++)
            if (U[i] != 0)
                return false;
        return true;
    };

    auto c2 = [&]()
    {
        for (int i = 0; i < N - 1; i++)
            if (U[i] != i || V[i] != i + 1)
                return false;
        return true;
    };

    auto c3 = [&]()
    {
        return N <= 200;
    };

    auto c4 = [&]()
    {
        return N <= 2000;
    };

    auto c5 = [&]()
    {
        for (int i = 0; i < N - 1; i++)
            if (W[i] != 1)
                return false;
        return true;
    };

    if (c1())
        return st1(N, U, V, W);
    if (c2())
        return st2(N, U, V, W);
    if (c3())
        return st3(N, U, V, W);
    if (c4())
        return st4(N, U, V, W);
    if (c5())
        return st5(N, U, V, W);

    return vector<long long>(N);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 23 ms 2892 KB Output is correct
13 Correct 36 ms 4540 KB Output is correct
14 Correct 43 ms 4216 KB Output is correct
15 Correct 46 ms 4528 KB Output is correct
16 Correct 46 ms 4556 KB Output is correct
17 Correct 61 ms 4548 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 32 ms 4164 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 34 ms 3820 KB Output is correct
3 Correct 40 ms 4232 KB Output is correct
4 Correct 39 ms 4536 KB Output is correct
5 Correct 40 ms 4532 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 22 ms 2764 KB Output is correct
13 Correct 34 ms 4540 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 30 ms 4056 KB Output is correct
16 Correct 34 ms 4532 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 232 KB Output is correct
5 Correct 3 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 104 ms 332 KB Output is correct
24 Correct 257 ms 484 KB Output is correct
25 Correct 214 ms 460 KB Output is correct
26 Correct 192 ms 472 KB Output is correct
27 Correct 144 ms 500 KB Output is correct
28 Correct 77 ms 460 KB Output is correct
29 Correct 209 ms 460 KB Output is correct
30 Correct 151 ms 460 KB Output is correct
31 Correct 122 ms 460 KB Output is correct
32 Correct 77 ms 492 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 2 ms 204 KB Output is correct
42 Correct 5 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 3 ms 204 KB Output is correct
46 Correct 2 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 208 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 156 ms 436 KB Output is correct
54 Correct 288 ms 484 KB Output is correct
55 Correct 111 ms 504 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 2 ms 204 KB Output is correct
60 Correct 2 ms 204 KB Output is correct
61 Correct 0 ms 204 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 253 ms 460 KB Output is correct
65 Correct 263 ms 484 KB Output is correct
66 Correct 93 ms 480 KB Output is correct
67 Correct 86 ms 488 KB Output is correct
68 Correct 116 ms 460 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13120 KB Output is correct
2 Correct 76 ms 14040 KB Output is correct
3 Correct 86 ms 15388 KB Output is correct
4 Correct 77 ms 14744 KB Output is correct
5 Correct 64 ms 15384 KB Output is correct
6 Correct 65 ms 15144 KB Output is correct
7 Correct 84 ms 15120 KB Output is correct
8 Correct 64 ms 17484 KB Output is correct
9 Correct 82 ms 18864 KB Output is correct
10 Correct 91 ms 14368 KB Output is correct
11 Correct 64 ms 15396 KB Output is correct
12 Correct 65 ms 16888 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 32 ms 5320 KB Output is correct
15 Correct 35 ms 5916 KB Output is correct
16 Correct 239 ms 496 KB Output is correct
17 Correct 268 ms 520 KB Output is correct
18 Correct 95 ms 504 KB Output is correct
19 Correct 80 ms 464 KB Output is correct
20 Correct 94 ms 584 KB Output is correct
21 Correct 32 ms 5064 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13120 KB Output is correct
2 Correct 76 ms 14040 KB Output is correct
3 Correct 86 ms 15388 KB Output is correct
4 Correct 77 ms 14744 KB Output is correct
5 Correct 64 ms 15384 KB Output is correct
6 Correct 65 ms 15144 KB Output is correct
7 Correct 84 ms 15120 KB Output is correct
8 Correct 64 ms 17484 KB Output is correct
9 Correct 82 ms 18864 KB Output is correct
10 Correct 91 ms 14368 KB Output is correct
11 Correct 64 ms 15396 KB Output is correct
12 Correct 65 ms 16888 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 32 ms 5320 KB Output is correct
15 Correct 35 ms 5916 KB Output is correct
16 Correct 239 ms 496 KB Output is correct
17 Correct 268 ms 520 KB Output is correct
18 Correct 95 ms 504 KB Output is correct
19 Correct 80 ms 464 KB Output is correct
20 Correct 94 ms 584 KB Output is correct
21 Correct 32 ms 5064 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Incorrect 29 ms 4040 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 23 ms 2892 KB Output is correct
13 Correct 36 ms 4540 KB Output is correct
14 Correct 43 ms 4216 KB Output is correct
15 Correct 46 ms 4528 KB Output is correct
16 Correct 46 ms 4556 KB Output is correct
17 Correct 61 ms 4548 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 32 ms 4164 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 34 ms 3820 KB Output is correct
22 Correct 40 ms 4232 KB Output is correct
23 Correct 39 ms 4536 KB Output is correct
24 Correct 40 ms 4532 KB Output is correct
25 Correct 1 ms 388 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 22 ms 2764 KB Output is correct
32 Correct 34 ms 4540 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 30 ms 4056 KB Output is correct
35 Correct 34 ms 4532 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 3 ms 232 KB Output is correct
40 Correct 3 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 2 ms 204 KB Output is correct
43 Correct 3 ms 204 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 2 ms 204 KB Output is correct
53 Correct 2 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 104 ms 332 KB Output is correct
59 Correct 257 ms 484 KB Output is correct
60 Correct 214 ms 460 KB Output is correct
61 Correct 192 ms 472 KB Output is correct
62 Correct 144 ms 500 KB Output is correct
63 Correct 77 ms 460 KB Output is correct
64 Correct 209 ms 460 KB Output is correct
65 Correct 151 ms 460 KB Output is correct
66 Correct 122 ms 460 KB Output is correct
67 Correct 77 ms 492 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 2 ms 332 KB Output is correct
74 Correct 0 ms 204 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 2 ms 204 KB Output is correct
77 Correct 5 ms 204 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 2 ms 204 KB Output is correct
80 Correct 3 ms 204 KB Output is correct
81 Correct 2 ms 204 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 0 ms 204 KB Output is correct
84 Correct 0 ms 208 KB Output is correct
85 Correct 1 ms 204 KB Output is correct
86 Correct 0 ms 204 KB Output is correct
87 Correct 0 ms 204 KB Output is correct
88 Correct 156 ms 436 KB Output is correct
89 Correct 288 ms 484 KB Output is correct
90 Correct 111 ms 504 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 1 ms 332 KB Output is correct
93 Correct 1 ms 204 KB Output is correct
94 Correct 2 ms 204 KB Output is correct
95 Correct 2 ms 204 KB Output is correct
96 Correct 0 ms 204 KB Output is correct
97 Correct 0 ms 204 KB Output is correct
98 Correct 0 ms 204 KB Output is correct
99 Correct 253 ms 460 KB Output is correct
100 Correct 263 ms 484 KB Output is correct
101 Correct 93 ms 480 KB Output is correct
102 Correct 86 ms 488 KB Output is correct
103 Correct 116 ms 460 KB Output is correct
104 Correct 89 ms 13120 KB Output is correct
105 Correct 76 ms 14040 KB Output is correct
106 Correct 86 ms 15388 KB Output is correct
107 Correct 77 ms 14744 KB Output is correct
108 Correct 64 ms 15384 KB Output is correct
109 Correct 65 ms 15144 KB Output is correct
110 Correct 84 ms 15120 KB Output is correct
111 Correct 64 ms 17484 KB Output is correct
112 Correct 82 ms 18864 KB Output is correct
113 Correct 91 ms 14368 KB Output is correct
114 Correct 64 ms 15396 KB Output is correct
115 Correct 65 ms 16888 KB Output is correct
116 Correct 0 ms 208 KB Output is correct
117 Correct 32 ms 5320 KB Output is correct
118 Correct 35 ms 5916 KB Output is correct
119 Correct 239 ms 496 KB Output is correct
120 Correct 268 ms 520 KB Output is correct
121 Correct 95 ms 504 KB Output is correct
122 Correct 80 ms 464 KB Output is correct
123 Correct 94 ms 584 KB Output is correct
124 Correct 32 ms 5064 KB Output is correct
125 Correct 0 ms 208 KB Output is correct
126 Correct 1 ms 208 KB Output is correct
127 Correct 0 ms 208 KB Output is correct
128 Incorrect 29 ms 4040 KB Output isn't correct
129 Halted 0 ms 0 KB -