oj.uz

Submission #528484

# Submission time Handle Problem Language Result Execution time Memory
528484 2022-02-20T11:06:19 Z cologne Road Closures (APIO21_roads) C++17
36 / 100
 276 ms 14252 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;
                save_cost.push_back(min(0LL, 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 += min(0, (int)save_cost.size() - min((int)save_cost.size() + leaf_count, k - 1));
            le += min(0, (int)save_cost.size() - min((int)save_cost.size() + leaf_count, k));
            return make_pair(lt, le);
        };

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

    return answer;
}

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 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 25 ms 3356 KB Output is correct
13 Correct 36 ms 5524 KB Output is correct
14 Correct 43 ms 5400 KB Output is correct
15 Correct 49 ms 5924 KB Output is correct
16 Correct 49 ms 5908 KB Output is correct
17 Correct 45 ms 5940 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 49 ms 5056 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 5200 KB Output is correct
3 Correct 37 ms 5444 KB Output is correct
4 Correct 43 ms 5720 KB Output is correct
5 Correct 40 ms 5664 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 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 25 ms 3660 KB Output is correct
13 Correct 34 ms 5632 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 33 ms 5292 KB Output is correct
16 Correct 35 ms 5668 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 280 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 272 KB Output is correct
5 Correct 3 ms 300 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 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 3 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 1 ms 216 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 280 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 272 KB Output is correct
5 Correct 3 ms 300 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 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 3 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 1 ms 216 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 99 ms 416 KB Output is correct
24 Correct 276 ms 524 KB Output is correct
25 Correct 179 ms 460 KB Output is correct
26 Correct 173 ms 496 KB Output is correct
27 Correct 153 ms 544 KB Output is correct
28 Correct 83 ms 524 KB Output is correct
29 Correct 201 ms 460 KB Output is correct
30 Correct 131 ms 520 KB Output is correct
31 Correct 153 ms 516 KB Output is correct
32 Correct 75 ms 540 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 296 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 2 ms 420 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 2 ms 204 KB Output is correct
42 Correct 4 ms 280 KB Output is correct
43 Correct 2 ms 204 KB Output is correct
44 Correct 3 ms 280 KB Output is correct
45 Correct 3 ms 304 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 204 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 147 ms 456 KB Output is correct
54 Correct 270 ms 512 KB Output is correct
55 Correct 120 ms 460 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 3 ms 280 KB Output is correct
60 Correct 2 ms 204 KB Output is correct
61 Correct 0 ms 280 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 243 ms 500 KB Output is correct
65 Correct 257 ms 504 KB Output is correct
66 Correct 97 ms 460 KB Output is correct
67 Correct 75 ms 504 KB Output is correct
68 Correct 96 ms 460 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 14252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 14252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 25 ms 3356 KB Output is correct
13 Correct 36 ms 5524 KB Output is correct
14 Correct 43 ms 5400 KB Output is correct
15 Correct 49 ms 5924 KB Output is correct
16 Correct 49 ms 5908 KB Output is correct
17 Correct 45 ms 5940 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 49 ms 5056 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 34 ms 5200 KB Output is correct
22 Correct 37 ms 5444 KB Output is correct
23 Correct 43 ms 5720 KB Output is correct
24 Correct 40 ms 5664 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 1 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 25 ms 3660 KB Output is correct
32 Correct 34 ms 5632 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 33 ms 5292 KB Output is correct
35 Correct 35 ms 5668 KB Output is correct
36 Correct 0 ms 280 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 2 ms 272 KB Output is correct
40 Correct 3 ms 300 KB Output is correct
41 Correct 1 ms 276 KB Output is correct
42 Correct 2 ms 204 KB Output is correct
43 Correct 2 ms 204 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 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 3 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 1 ms 216 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 99 ms 416 KB Output is correct
59 Correct 276 ms 524 KB Output is correct
60 Correct 179 ms 460 KB Output is correct
61 Correct 173 ms 496 KB Output is correct
62 Correct 153 ms 544 KB Output is correct
63 Correct 83 ms 524 KB Output is correct
64 Correct 201 ms 460 KB Output is correct
65 Correct 131 ms 520 KB Output is correct
66 Correct 153 ms 516 KB Output is correct
67 Correct 75 ms 540 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 296 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 2 ms 420 KB Output is correct
74 Correct 0 ms 204 KB Output is correct
75 Correct 0 ms 204 KB Output is correct
76 Correct 2 ms 204 KB Output is correct
77 Correct 4 ms 280 KB Output is correct
78 Correct 2 ms 204 KB Output is correct
79 Correct 3 ms 280 KB Output is correct
80 Correct 3 ms 304 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 204 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 147 ms 456 KB Output is correct
89 Correct 270 ms 512 KB Output is correct
90 Correct 120 ms 460 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 3 ms 280 KB Output is correct
95 Correct 2 ms 204 KB Output is correct
96 Correct 0 ms 280 KB Output is correct
97 Correct 0 ms 204 KB Output is correct
98 Correct 0 ms 204 KB Output is correct
99 Correct 243 ms 500 KB Output is correct
100 Correct 257 ms 504 KB Output is correct
101 Correct 97 ms 460 KB Output is correct
102 Correct 75 ms 504 KB Output is correct
103 Correct 96 ms 460 KB Output is correct
104 Incorrect 102 ms 14252 KB Output isn't correct
105 Halted 0 ms 0 KB -