| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 737298 | keisuke6 | Road Closures (APIO21_roads) | C++14 | 0 ms | 0 KiB |
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"
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
std::vector<int> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
sort(W.begin(),W.end());
vector<int> A = {0};
int now = 0;
for(int i=0;i<W.size();i++){
now += W[i];
A.push_back(now);
}
reverse(A.begin(),A.end());
return A;
}
