oj.uz

Submission #528433

# Submission time Handle Problem Language Result Execution time Memory
528433 2022-02-20T09:47:02 Z cologne Road Closures (APIO21_roads) C++17
26 / 100
 47 ms 5096 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 <= 200;
    };

    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 1 ms 332 KB Output is correct
3 Correct 1 ms 340 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 280 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 280 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 21 ms 3276 KB Output is correct
13 Correct 36 ms 5096 KB Output is correct
14 Correct 41 ms 4560 KB Output is correct
15 Correct 47 ms 5016 KB Output is correct
16 Correct 46 ms 5060 KB Output is correct
17 Correct 43 ms 5048 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 31 ms 4652 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 29 ms 4332 KB Output is correct
3 Correct 41 ms 4732 KB Output is correct
4 Correct 37 ms 4888 KB Output is correct
5 Correct 36 ms 4880 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 276 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 18 ms 3148 KB Output is correct
13 Correct 33 ms 4844 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 30 ms 4508 KB Output is correct
16 Correct 33 ms 4932 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 3 ms 208 KB Output is correct
18 Correct 2 ms 280 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 0 ms 280 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Incorrect 1 ms 296 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 3720 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 1 ms 332 KB Output is correct
3 Correct 1 ms 340 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 280 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 280 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 21 ms 3276 KB Output is correct
13 Correct 36 ms 5096 KB Output is correct
14 Correct 41 ms 4560 KB Output is correct
15 Correct 47 ms 5016 KB Output is correct
16 Correct 46 ms 5060 KB Output is correct
17 Correct 43 ms 5048 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 31 ms 4652 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 29 ms 4332 KB Output is correct
22 Correct 41 ms 4732 KB Output is correct
23 Correct 37 ms 4888 KB Output is correct
24 Correct 36 ms 4880 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 0 ms 276 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 18 ms 3148 KB Output is correct
32 Correct 33 ms 4844 KB Output is correct
33 Correct 1 ms 280 KB Output is correct
34 Correct 30 ms 4508 KB Output is correct
35 Correct 33 ms 4932 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 2 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 2 ms 208 KB Output is correct
43 Correct 3 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 1 ms 208 KB Output is correct
46 Correct 1 ms 284 KB Output is correct
47 Correct 1 ms 208 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 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 3 ms 208 KB Output is correct
53 Correct 2 ms 280 KB Output is correct
54 Correct 1 ms 208 KB Output is correct
55 Correct 0 ms 280 KB Output is correct
56 Correct 1 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Incorrect 1 ms 296 KB Output isn't correct
59 Halted 0 ms 0 KB -