제출 #1047889

#제출 시각아이디문제언어결과실행 시간메모리
1047889Marco_Escandon도로 폐쇄 (APIO21_roads)C++11
5 / 100
30 ms9168 KiB
//#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W) {
    vector<pair<ll,pair<ll,ll>>> cad;
    ll n=N;
    for(int i=0; i<N-1; i++)
    {
        cad.push_back({W[i],{U[i],V[i]}});
    }
    sort(cad.begin(),cad.end());
    vector<ll> s(n,0);
    ll cost=0;
    for(int i=0; i<n-1; i++)
    {
        cost+=cad[i].x;
        s[n-i-2]=cost;
    }
    return s;
}
#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...