Submission #1200518

#TimeUsernameProblemLanguageResultExecution timeMemory
1200518ElayV13Road Closures (APIO21_roads)C++20
0 / 100
26 ms3400 KiB
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;

vector < long long > minimum_closure_costs(int n , vector < int > u , vector < int > v , vector < int > w)
{
        vector < long long > res(n);
        sort(w.begin() , w.end());
        long long s = accumulate(w.begin() , w.end() , 0ll);
        for(int i = 0;i < w.size();i++)
        {
                res[i] = s;
                s -= w[i];
        }
        return res;
}
#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...