제출 #1162509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162509		tw20000807	도로 폐쇄 (APIO21_roads)	C++20	5 / 100	44 ms	10824 KiB

roads

#include "roads.h"
#include<bits/stdc++.h>
using namespace std;

vector<long long> minimum_closure_costs(int n, vector<int> u,  vector<int> v, vector<int> w){
    #define all(v) v.begin(), v.end()
    #define int long long
    #define pii pair<int, int>
    #define X first
    #define Y second
    #define SZ(s) ((int)s.size())

    vector< vector< pii > > g(n);
    vector< int > ans(n);
    for(int i = 0; i < n - 1; ++i){
        g[u[i]].push_back({v[i], w[i]});
        g[v[i]].push_back({u[i], w[i]});
        ans[0] += w[i];
    }
    sort(all(w), greater<>());
    for(int i = 0; i < n - 1; ++i){
      ans[i + 1] = ans[i] - w[i];
    }
    return ans;
}

• Subtask 1: 5 / 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