Submission #1223383

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223383		KALARRY	Road Closures (APIO21_roads)	C++20	5 / 100	32 ms	3872 KiB

roads

#include <cassert>
#include <cstdio>

#include <vector>

#include<bits/stdc++.h>

using namespace std;


std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vector<long long> ans;
    sort(W.begin(),W.end(),greater<long long>());
    long long sum = 0;
    for(auto x : W)
        sum += x;
    vector<long long> ret;
    for(int i = 0 ; i <= N-1 ; i++)
    {
        ret.push_back(sum);
        sum -= W[i];
    }
    return ret;
}

• 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