oj.uz

답안 #561582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561582 2022-05-13T08:04:29 Z piOOE 도로 폐쇄 (APIO21_roads) C++17
0 / 100
 212 ms 6012 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 = 2001;
int A[N], B[N], W[N], n;
ll dp[N][2];
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);
        }
    }
    if (k > (int) size(adj)) {
        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 < (int) size(nw); ++i) {
            if (nw[i] < 0)
                ans += nw[i];
        }
        dp[v][1] = dp[0][v] = ans;
    } else {
        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));
        ll added = 0;
        for (int i = 0; i < k - 1; ++i) {
            if (nw[i] < 0)
                added += nw[i];
        }
        dp[v][1] = ans + added;
        added = 0;
        for (int i = 0; i < k; ++i) {
            added += nw[i];
        }
        dp[v][0] = min(dp[v][1], ans + added);
    }
}

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 169 ms 596 KB Output is correct
3 Correct 212 ms 604 KB Output is correct
4 Correct 83 ms 604 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 75 ms 572 KB Output is correct
9 Correct 118 ms 576 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Runtime error 16 ms 4004 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Runtime error 37 ms 5708 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 3 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 3 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 28 ms 6012 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 28 ms 6012 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 169 ms 596 KB Output is correct
3 Correct 212 ms 604 KB Output is correct
4 Correct 83 ms 604 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 75 ms 572 KB Output is correct
9 Correct 118 ms 576 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Runtime error 16 ms 4004 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -