Submission #1117065

#	Time	Username	Problem	Language	Result	Execution time	Memory
1117065		ortsac	Road Closures (APIO21_roads)	C++17	5 / 100	37 ms	5560 KiB

roads

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

using namespace std;

#define int long long

vector<int> minimum_closure_costs(int32_t n, vector<int32_t> a, vector<int32_t> b, vector<int32_t> w) {
  vector<int> ans(n);
  sort(w.begin(), w.end());
  int curr = 0;
  for (int i = 0; i < n; i++) {
    if (i > 0) curr += (w[i - 1]);
    ans[i] = curr;
  }
  reverse(ans.begin(), ans.end());
  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