# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437698 | ala2 | 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 ;
vector<long long>v;
vector<long long> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W) {
sort(W.begin(),W.end());
v.push_back(W[0]);
for(int i=1;i<n;i++)
v.push_back(v[0]+W[1]);
v.pop_back();
return v;