제출 #735907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735907		hoainiem	도로 폐쇄 (APIO21_roads)	C++14	0 / 100	193 ms	34276 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define nmax 100008
using namespace std;
typedef pair<int, int> pii;
int n;
long long dp[2008][2008];
vector<pii> l[nmax];
void dfs(int id, int x, int pre){
    vector<long long>vt;
    dp[id][x] = 0;
    for (pii it : l[x])
        if (it.fi != pre){
            dfs(id, it.fi, x);
            if (!id)
                dp[id][x] += dp[id][it.fi] + it.se;
            else{
                dp[id][x] += dp[id - 1][it.fi];
                vt.push_back(dp[id][it.fi] + it.se - dp[id - 1][it.fi]);
            }
        }
    sort(vt.begin(), vt.end(), greater<long long>());
    while (!vt.empty() && ((int)vt.size() > id || vt.back() < 0)){
        dp[id][x] += vt.back();
        vt.pop_back();
    }
}
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    assert((n = N) <= 2000);
    for (int i = 0; i < n - 1; i++){
        l[U[i]].push_back({V[i], W[i]});
        l[V[i]].push_back({U[i], W[i]});
    }
    vector<long long>res;
    for (int k = 0; k < n; k++){
        dfs(k, 0, 0);
        res.push_back(dp[k][0]);
    }
    return res;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22