Submission #1082745

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082745		blackslex	Road Closures (APIO21_roads)	C++17	5 / 100	39 ms	5976 KiB

roads

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

using namespace std;
using ll = long long;

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  int n = N, m = U.size();
  ll res = 0;
  priority_queue<int> pq;
  for (int i = 0; i < m; i++) res += W[i], pq.emplace(W[i]);
  vector<ll> ans;
  for (int i = 0; i < n; i++) {
    ans.emplace_back(res);
    if (!pq.empty()) res -= pq.top(), pq.pop();
  }
  return ans;
}

• 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