Submission #569474

#	Time	Username	Problem	Language	Result	Execution time	Memory
569474		Turkhuu	Road Closures (APIO21_roads)	C++17	5 / 100	47 ms	3636 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
std::vector<long long> minimum_closure_costs(int n, std::vector<int> u, std::vector<int> v, std::vector<int> w){
  sort(w.begin(), w.end());
  std::vector<long long> ans(n);
  for(int i = 0; i < n - 1; i++){
    ans[n - i - 2] = ans[n - i - 1] + w[i];
  }
  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