oj.uz

Submission #528434

# Submission time Handle Problem Language Result Execution time Memory
528434 2022-02-20T09:47:41 Z cologne Road Closures (APIO21_roads) C++17
36 / 100
 294 ms 4548 KB 
#include "roads.h"

#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
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> 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;
    };

    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);

    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 2 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 1 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 0 ms 204 KB Output is correct
12 Correct 22 ms 2788 KB Output is correct
13 Correct 41 ms 4548 KB Output is correct
14 Correct 42 ms 4012 KB Output is correct
15 Correct 47 ms 4540 KB Output is correct
16 Correct 47 ms 4548 KB Output is correct
17 Correct 45 ms 4516 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 33 ms 4176 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 45 ms 3824 KB Output is correct
3 Correct 35 ms 4332 KB Output is correct
4 Correct 38 ms 4520 KB Output is correct
5 Correct 39 ms 4528 KB Output is correct
6 Correct 1 ms 332 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 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 23 ms 2764 KB Output is correct
13 Correct 33 ms 4536 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 30 ms 4160 KB Output is correct
16 Correct 45 ms 4512 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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 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 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 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 0 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 4 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 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 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 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 0 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 4 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 94 ms 332 KB Output is correct
24 Correct 294 ms 528 KB Output is correct
25 Correct 178 ms 468 KB Output is correct
26 Correct 168 ms 464 KB Output is correct
27 Correct 155 ms 556 KB Output is correct
28 Correct 94 ms 464 KB Output is correct
29 Correct 215 ms 488 KB Output is correct
30 Correct 128 ms 528 KB Output is correct
31 Correct 155 ms 520 KB Output is correct
32 Correct 81 ms 540 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 464 KB Output is correct
37 Correct 1 ms 420 KB Output is correct
38 Correct 1 ms 420 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 3 ms 208 KB Output is correct
43 Correct 2 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 3 ms 336 KB Output is correct
46 Correct 4 ms 208 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 1 ms 208 KB Output is correct
50 Correct 1 ms 284 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 0 ms 280 KB Output is correct
53 Correct 144 ms 464 KB Output is correct
54 Correct 269 ms 504 KB Output is correct
55 Correct 133 ms 528 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 3 ms 208 KB Output is correct
60 Correct 2 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 259 ms 500 KB Output is correct
65 Correct 256 ms 512 KB Output is correct
66 Correct 104 ms 500 KB Output is correct
67 Correct 93 ms 464 KB Output is correct
68 Correct 90 ms 504 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 3276 KB Output isn't correct
2 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 2 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 1 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 0 ms 204 KB Output is correct
12 Correct 22 ms 2788 KB Output is correct
13 Correct 41 ms 4548 KB Output is correct
14 Correct 42 ms 4012 KB Output is correct
15 Correct 47 ms 4540 KB Output is correct
16 Correct 47 ms 4548 KB Output is correct
17 Correct 45 ms 4516 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 33 ms 4176 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 45 ms 3824 KB Output is correct
22 Correct 35 ms 4332 KB Output is correct
23 Correct 38 ms 4520 KB Output is correct
24 Correct 39 ms 4528 KB Output is correct
25 Correct 1 ms 332 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 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 23 ms 2764 KB Output is correct
32 Correct 33 ms 4536 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 30 ms 4160 KB Output is correct
35 Correct 45 ms 4512 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 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 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 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 0 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 4 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 94 ms 332 KB Output is correct
59 Correct 294 ms 528 KB Output is correct
60 Correct 178 ms 468 KB Output is correct
61 Correct 168 ms 464 KB Output is correct
62 Correct 155 ms 556 KB Output is correct
63 Correct 94 ms 464 KB Output is correct
64 Correct 215 ms 488 KB Output is correct
65 Correct 128 ms 528 KB Output is correct
66 Correct 155 ms 520 KB Output is correct
67 Correct 81 ms 540 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 464 KB Output is correct
72 Correct 1 ms 420 KB Output is correct
73 Correct 1 ms 420 KB Output is correct
74 Correct 0 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 3 ms 208 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 2 ms 208 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 4 ms 208 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 284 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 0 ms 280 KB Output is correct
88 Correct 144 ms 464 KB Output is correct
89 Correct 269 ms 504 KB Output is correct
90 Correct 133 ms 528 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 336 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 3 ms 208 KB Output is correct
95 Correct 2 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 0 ms 208 KB Output is correct
99 Correct 259 ms 500 KB Output is correct
100 Correct 256 ms 512 KB Output is correct
101 Correct 104 ms 500 KB Output is correct
102 Correct 93 ms 464 KB Output is correct
103 Correct 90 ms 504 KB Output is correct
104 Incorrect 32 ms 3276 KB Output isn't correct
105 Halted 0 ms 0 KB -