Submission #824550

#	Time	Username	Problem	Language	Result	Execution time	Memory
824550		Hanksburger	Road Closures (APIO21_roads)	C++17	5 / 100	41 ms	8068 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> u, v, w;
vector<long long> minimum_closure_costs(int nn, vector<int> uu, vector<int> vv, vector<int> ww)
{
    long long n=nn;
    for (long long i=0; i<n-1; i++)
        u.push_back(uu[i]), v.push_back(vv[i]), w.push_back(ww[i]);
    sort(w.begin(), w.end());
    for (long long i=1; i<n-1; i++)
        w[i]+=w[i-1];
    reverse(w.begin(), w.end());
    w.push_back(0);
    return w;
}

• 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