Submission #1200519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200519		ElayV13	Road Closures (APIO21_roads)	C++20	5 / 100	30 ms	3772 KiB

roads

#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());
        reverse(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;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22