제출 #722453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722453		grossly_overconfident	도로 폐쇄 (APIO21_roads)	C++17	0 / 100	2066 ms	1048576 KiB

roads

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
//#define int long long
//#define INT_MAX LONG_LONG_MAX

long long findscore(set<pair<long long, pair<long long, long long>>>& candidates, int k, int j){
    long long score = 0;
    for (auto i : candidates){
        if (j <= k){
            score += min(i.second.first, i.second.second);
        }
        else{
            j--;
            score += i.second.second;
        }
    }
    return score;
}

long long solve(vector<vector<long long>>& dp, vector<vector<pair<int, int>>>& adj, int p, int n, int k, int i, int j){
    if (dp[i][j] != -1){
        return dp[i][j];
    }
    bool ac = true;
    set<pair<long long, pair<long long, long long>>> candidates;
    for (auto a : adj[i]){
        if (a.first != p){
            ac = false;
            long long op1 = solve(dp, adj, i, n, k, a.first, adj[a.first].size());
            long long op2 = solve(dp, adj, i, n, k, a.first, adj[a.first].size() - 1) + a.second;
            candidates.insert({op2 - op1, {op1, op2}});
        }
    }
    if (ac){
        return 0;
    }
    return dp[i][j] = findscore(candidates, k, j);
}

vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
    vector<long long> out(n);
    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < n - 1; ++i){
        adj[u[i]].push_back({v[i], w[i]});
        adj[v[i]].push_back({u[i], w[i]});
    }

    int leaf = 0;

    for (int i = 0; i < n; ++i){
        if (adj[i].size() == 1){
            leaf = i;
            break;
        }
    }
    /*
    vector<vector<long long>> dp(n + 10, vector<long long>(n + 10, -1));
    cout << solve(dp, adj, -1, n, 1, leaf, adj[leaf].size()) << endl;

    for (auto a : dp){
        for (auto b : a){
            cout << b << " ";
        }
        cout << endl;
    }
    */
    for (int i = 0; i < n; ++i){
        vector<vector<long long>> dp(n + 10, vector<long long>(n + 10, -1));
        out[i] = solve(dp, adj, -1, n, i, leaf, adj[leaf].size());
    }
    
    return out;
}
/*
int main(){
    int n;
    cin >> n;
    vector<int> u(n - 1), v(n - 1), w(n - 1);
    for (int i = 0; i < n - 1; ++i){
        cin >> u[i];
    }
    for (int i = 0; i < n - 1; ++i){
        cin >> v[i];
    }
    for (int i = 0; i < n - 1; ++i){
        cin >> w[i];
    }
    vector<long long> out;
    out = minimum_closure_costs(n, u, v, w);
    for (auto a : out){
        cout << a << " ";
    }
}
*/

• 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