제출 #569325

#제출 시각아이디문제언어결과실행 시간메모리
569325gavgav도로 폐쇄 (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-1); ll sum=0; for(ll i=0;i<n-1;ws[i]=w[i],sum+=w[i],++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...