답안 #561566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561566 2022-05-13T07:24:56 Z piOOE 도로 폐쇄 (APIO21_roads) C++17
14 / 100
68 ms 5044 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];
int k;
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 con = 0; con <= min(k, (int) size(adj)); ++con) {
        vector<ll> nw;
        ll ans = 0;
        for (auto [to, w]: adj) {
            ans += dp[to][0] + w;
            nw.push_back(dp[to][1] - dp[to][0] - w);
        }
        sort(all(nw));
        for (int i = 0; i < con; ++i) {
            ans += nw[i];
        }
        dp[v][min(k, (int) size(adj) + 1) - con] = ans;
    }
    for (int i = min((int) size(adj) + 1, k) - 1; i > -1; --i) {
        dp[v][i] = min(dp[v][i], dp[v][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;
    for (k = 0; k < n; ++k) {
        dfs(0, -1);
        ans.push_back(dp[0][0]);
    }
    return ans;
}
# 결과 실행 시간 메모리 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 -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 36 ms 4816 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 11 ms 628 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 24 ms 536 KB Output is correct
14 Correct 68 ms 596 KB Output is correct
15 Correct 44 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 8 ms 596 KB Output is correct
18 Correct 9 ms 636 KB Output is correct
19 Correct 41 ms 604 KB Output is correct
20 Correct 50 ms 632 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 7 ms 596 KB Output is correct
6 Correct 11 ms 628 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 24 ms 536 KB Output is correct
14 Correct 68 ms 596 KB Output is correct
15 Correct 44 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 8 ms 596 KB Output is correct
18 Correct 9 ms 636 KB Output is correct
19 Correct 41 ms 604 KB Output is correct
20 Correct 50 ms 632 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Runtime error 2 ms 596 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 31 ms 5044 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 31 ms 5044 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 -