제출 #569322

#제출 시각아이디문제언어결과실행 시간메모리
569322gavgav도로 폐쇄 (APIO21_roads)C++17
0 / 100
35 ms3236 KiB
#include<bits/stdc++.h>
using namespace std;
#define vec vector
#define ll long long
vec<ll>minimum_closure_costs(int n,vec<int> u,vec<int> v,vec<int> w){
    vec<ll> ws(n, 0);
    ll sum=0;
    for(ll i=1;i<n;ws[i]=w[i-1],sum+=w[i-1],++i);
    sort(++(ws.begin()),ws.end(),greater<ll>());
    ll ans[n]{sum};
    for(ll i=1;i<n;++i){
        ans[i]=ans[i-1]-ws[i-1];
    }
    return ws;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...