Submission #1352709

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352709		nathlol2	Road Closures (APIO21_roads)	C++20	5 / 100	29 ms	4008 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W){
  priority_queue<int, vector<int>, greater<int>> pq;
  for(int i = 0;i<W.size();i++) pq.push(W[i]);
  vector<long long> ans(N);
  for(int i = N - 2;i>=0;i--){
    ans[i] = ans[i + 1] + 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