Submission #969600

#	Time	Username	Problem	Language	Result	Execution time	Memory
969600		europium	Road Closures (APIO21_roads)	C++17	0 / 100	28 ms	3416 KiB

roads

#include "roads.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
    vector<ll> ans(n);

    ll cost = accumulate(W.begin(), W.end(), ll(0));
    ans[0] = cost;

    // sort(W.rbegin(), W.rend());
    //
    // for (int i = 0; i < n - 1; i++) {
    //     cost -= W[i];
    //     ans[i+1] = cost;
    // }

    return ans;
}

• Subtask 1: 0 / 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