Submission #1356479

#	Time	Username	Problem	Language	Result	Execution time	Memory
1356479		Desh03	Road Closures (APIO21_roads)	C++20	0 / 100	2094 ms	4496 KiB

roads

#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<int> id(n - 1);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](const int &i, const int &j) {
        return w[i] < w[j];
    });
    vector<int> d(n);
    for (int i = 0; i + 1 < n; i++) {
        ++d[u[i]];
        ++d[v[i]];
    }
    vector<long long> ans(n);
    for (int k = 0; k < n; k++) {
        auto d2 = d;
        vector<bool> done(n - 1);
        for (int i : id) {
            if (d2[u[i]] > k && d2[v[i]] > k) {
                --d2[u[i]];
                --d2[v[i]];
                ans[k] += w[i];
                done[i] = 1;
            }
        }
        for (int i : id) {
            if (!done[i] && (d2[u[i]] > k || d2[v[i]] > k)) {
                --d2[u[i]];
                --d2[v[i]];
                ans[k] += w[i];
            }
        }
    }
    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