oj.uz

Submission #650705

# Submission time Handle Problem Language Result Execution time Memory
650705 2022-10-14T18:53:40 Z Alexandruabcde Road Closures (APIO21_roads) C++14
31 / 100
 2000 ms 34896 KB 
#include "roads.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

constexpr int NMAX = 100005;
typedef long long LL;
constexpr LL INF = 1LL * 1e15;

struct muchie {
    int x, y;
    LL cost;
};

muchie E[NMAX];

vector <int> G[NMAX];
vector <int> Degree[NMAX];
vector <int> GoodNodes;
bool Unlocked[NMAX];
LL dp[NMAX][2];
bool viz[NMAX];

void Dfs (int k, int Node, int dad = -1) {
    viz[Node] = true;

    for (auto it : G[Node]) {
        int to = (E[it].x == Node ? E[it].y : E[it].x);

        if (to == dad) continue;
        if (viz[to]) continue;
        if (!Unlocked[to]) continue;

        Dfs(k, to, Node);
    }

    int grad = 0;
    vector <LL> V;
    LL sum = 0;

    for (auto it : G[Node]) {
        int to = (E[it].x == Node ? E[it].y : E[it].x);

        if (to == dad) continue;

        ++ grad;
        if (Unlocked[to]) {
            V.push_back(dp[to][1] - dp[to][0]);
            sum += dp[to][0];
        }
        else {
            V.push_back(E[it].cost);
        }
    }

    dp[Node][0] = INF;
    dp[Node][1] = INF;

    sort(V.begin(), V.end());

    if (k > 0) {
        dp[Node][0] = sum;
        for (int i = 0; i < max(0, grad - k + 1); ++ i )
            dp[Node][0] += V[i];

        for (int i = max(0, grad - k + 1); i < V.size() && V[i] < 0; ++ i )
            dp[Node][0] += V[i];
    }

    if (dad == -1) {
        dp[Node][1] = sum;
        for (int i = 0; i < max(0, grad - k); ++ i )
            dp[Node][1] += V[i];
        for (int i = max(0, grad - k); i < V.size() && V[i] < 0; ++ i )
            dp[Node][1] += V[i];
    }

    for (auto it : G[Node]) {
        int to = (E[it].x == Node ? E[it].y : E[it].x);

        if (to != dad) continue;

        dp[Node][1] = sum + E[it].cost;
        for (int i = 0; i < max(0, grad - k); ++ i )
            dp[Node][1] += V[i];
        for (int i = max(0, grad - k); i < V.size() && V[i] < 0; ++ i )
            dp[Node][1] += V[i];

        break;
    }
}

LL Solve (int K) {
    LL ans = 0;
    for (auto it : GoodNodes) {
        if (viz[it]) continue;

        Dfs(K, it, -1);
        ans += dp[it][1];
    }

    for (auto it : GoodNodes)
        viz[it] = false;

    return ans;
}

void Add (int Node) {
    GoodNodes.push_back(Node);
    Unlocked[Node] = true;
}

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {

    for (int i = 1; i < N; ++ i ) {
        E[i] = {U[i-1], V[i-1], 1LL * W[i-1]};

        G[U[i-1]].push_back(i);
        G[V[i-1]].push_back(i);
    }

    for (int i = 0; i < N; ++ i ) {
        Degree[G[i].size()].push_back(i);
    }

    vector <LL> ans;
    ans.resize(N);

    for (int k = N-1; k >= 0; -- k ) {
        ans[k] = Solve(k);

        for (auto it : Degree[k])
            Add(it);
    }

    return ans;
}

Compilation message

roads.cpp: In function 'void Dfs(int, int, int)':
roads.cpp:68:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for (int i = max(0, grad - k + 1); i < V.size() && V[i] < 0; ++ i )
      |                                            ~~^~~~~~~~~~
roads.cpp:76:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for (int i = max(0, grad - k); i < V.size() && V[i] < 0; ++ i )
      |                                        ~~^~~~~~~~~~
roads.cpp:88:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for (int i = max(0, grad - k); i < V.size() && V[i] < 0; ++ i )
      |                                        ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 136 ms 5204 KB Output is correct
3 Correct 165 ms 5204 KB Output is correct
4 Correct 73 ms 5216 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 55 ms 5192 KB Output is correct
9 Correct 94 ms 5216 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Execution timed out 2070 ms 11380 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 69 ms 28000 KB Output is correct
3 Correct 79 ms 32956 KB Output is correct
4 Correct 81 ms 34736 KB Output is correct
5 Correct 76 ms 34896 KB Output is correct
6 Correct 3 ms 5460 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5012 KB Output is correct
12 Correct 47 ms 22476 KB Output is correct
13 Correct 79 ms 33964 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 64 ms 31140 KB Output is correct
16 Correct 68 ms 33956 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4992 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 5048 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 4 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 4 ms 5076 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 7 ms 5228 KB Output is correct
27 Correct 25 ms 5212 KB Output is correct
28 Correct 12 ms 5204 KB Output is correct
29 Correct 5 ms 5204 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 7 ms 5240 KB Output is correct
32 Correct 22 ms 5320 KB Output is correct
33 Correct 4 ms 5460 KB Output is correct
34 Correct 4 ms 5460 KB Output is correct
35 Correct 3 ms 5460 KB Output is correct
36 Correct 143 ms 5208 KB Output is correct
37 Correct 160 ms 5204 KB Output is correct
38 Correct 54 ms 5204 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5044 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 3 ms 4948 KB Output is correct
47 Correct 3 ms 4948 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 3 ms 5076 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 4 ms 5176 KB Output is correct
54 Correct 4 ms 5204 KB Output is correct
55 Correct 19 ms 5204 KB Output is correct
56 Correct 58 ms 5196 KB Output is correct
57 Correct 110 ms 5204 KB Output is correct
58 Correct 4 ms 4948 KB Output is correct
59 Correct 3 ms 4948 KB Output is correct
60 Correct 3 ms 4948 KB Output is correct
61 Correct 3 ms 4948 KB Output is correct
62 Correct 3 ms 4948 KB Output is correct
63 Correct 3 ms 4948 KB Output is correct
64 Correct 4 ms 5204 KB Output is correct
65 Correct 4 ms 5204 KB Output is correct
66 Correct 6 ms 5204 KB Output is correct
67 Correct 21 ms 5204 KB Output is correct
68 Correct 5 ms 5204 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 15596 KB Output is correct
2 Correct 149 ms 16744 KB Output is correct
3 Correct 632 ms 17520 KB Output is correct
4 Correct 126 ms 17120 KB Output is correct
5 Correct 595 ms 17472 KB Output is correct
6 Execution timed out 2072 ms 15396 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 15596 KB Output is correct
2 Correct 149 ms 16744 KB Output is correct
3 Correct 632 ms 17520 KB Output is correct
4 Correct 126 ms 17120 KB Output is correct
5 Correct 595 ms 17472 KB Output is correct
6 Execution timed out 2072 ms 15396 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 136 ms 5204 KB Output is correct
3 Correct 165 ms 5204 KB Output is correct
4 Correct 73 ms 5216 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 55 ms 5192 KB Output is correct
9 Correct 94 ms 5216 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Execution timed out 2070 ms 11380 KB Time limit exceeded
13 Halted 0 ms 0 KB -