This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "roads.h"
using namespace std;
#include <bits/stdc++.h>
#include <vector>
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V,std::vector<int> W) {
std::vector <long long> ans(N,0);
long long res=0;
for(auto &x: W) res+=x;
sort(W.begin(),W.end(),greater<int>());
ans[0]=res;
for(int i=0; i<N-1; i++){
res-=W[i];
ans[i+1]=res;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |