제출 #1072915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1072915		stdfloat	도로 폐쇄 (APIO21_roads)	C++17	31 / 100	2100 ms	31692 KiB

roads

#include <bits/stdc++.h>
#include "roads.h"
// #include "grader.cpp"
using namespace std;
 
using ll = long long;
 
#define ff  first
#define ss  second
#define pii pair<int, int>
 
vector<bool> vis;

vector<vector<ll>> dp;
 
vector<vector<pii>> E;
 
void dfs(int x, int k, bool f, int p = -1) {
    vis[x] = true;

    if (dp[x][f] == LLONG_MAX) dp[x][f] = 0;
    else return;
 
    vector<ll> v;
    for (auto [i, w] : E[x]) {
        if (i == p) {
            if (f == 1) dp[x][f] += w;
            continue;
        }
 
        if ((int)E[i].size() >= k) {
            dfs(i, k, 0, x);
            dfs(i, k, 1, x);

            dp[x][f] += dp[i][0];
            v.push_back(dp[i][1] - dp[i][0]);
        }
        else v.push_back(w);
    }
 
    sort(v.begin(), v.end());
 
    for (int i = 0; i < (int)E[x].size() - k - f || (i < (int)v.size() && v[i] < 0); i++) {
        dp[x][f] += v[i];
    }
}
 
vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
    E.assign(n, {});
 
    vector<ll> ans = {0};
    for (int i = 0; i < n - 1; i++) {
        ans[0] += W[i];
        E[U[i]].push_back({V[i], W[i]});
        E[V[i]].push_back({U[i], W[i]});
    }
 
    vector<pii> v;
    for (int i = 0; i < n; i++) {
        v.push_back({(int)E[i].size(), i});
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());

    vis.assign(n, false);
    dp.assign(n, vector<ll>(2, LLONG_MAX));
    for (int i = 1; i < n; i++) {
        while (v.back().ff < i) v.pop_back();

        for (auto j : v) {
            vis[j.ss] = false;
            dp[j.ss][0] = dp[j.ss][1] = LLONG_MAX;
        }

        ll sm = 0;
        for (auto j : v) {
            if (vis[j.ss]) continue;

            dfs(j.ss, i, 0);
            sm += dp[j.ss][0];
        }
    
        ans.push_back(sm);
    }
 
    return ans;
}

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