oj.uz

Submission #561563

# Submission time Handle Problem Language Result Execution time Memory
561563 2022-05-13T07:21:06 Z piOOE Road Closures (APIO21_roads) C++17
0 / 100
 34 ms 36052 KB 
#include "roads.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)

typedef long long ll;

const int N = 201;
int A[N], B[N], W[N], n;
ll dp[N][N][N];
vector<pair<int, int>> g[N];

void dfs(int v, int p) {
    vector<pair<int, int>> adj;
    for (auto [to, w]: g[v]) {
        if (to != p) {
            dfs(to, v);
            adj.emplace_back(to, w);
        }
    }
    for (int k = 0; k < n; ++k) {
        for (int con = 0; con <= min(k, (int) size(adj)); ++con) {
            vector<ll> nw;
            ll ans = 0;
            for (auto [to, w]: adj) {
                ans += dp[to][k][0] + w;
                if (k) {
                    nw.push_back(dp[to][k][1] - dp[to][k][0] - w);
                }
            }
            sort(all(nw));
            for (int i = 0; i < con; ++i) {
                ans += nw[i];
            }
            dp[v][k][min(k, (int)size(adj) + 1) - con] = ans;
        }
        for (int i = min((int)size(adj) + 1, k) - 1; i > -1; --i) {
            dp[v][k][i] = min(dp[v][k][i], dp[v][k][i + 1]);
        }
    }
}

vector<ll> minimum_closure_costs(int nn, vector<int> uu, vector<int> vv, vector<int> ww) {
    n = nn;
    for (int i = 0; i < n - 1; ++i) {
        A[i] = uu[i], B[i] = vv[i], W[i] = ww[i];
        g[A[i]].emplace_back(B[i], W[i]);
        g[B[i]].emplace_back(A[i], W[i]);
    }
    vector<ll> ans;
    dfs(0, -1);
    for (int i = 0; i < n; ++i) {
        ans.push_back(dp[0][i][0]);
    }
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2 ms 724 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 28 ms 4764 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 16 ms 36052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 16 ms 36052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 10088 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 10088 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2 ms 724 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -