Submission #984424

#	Time	Username	Problem	Language	Result	Execution time	Memory
984424		Marcus	Road Closures (APIO21_roads)	C++17	5 / 100	46 ms	5564 KiB

roads

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

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  vector<ll> presum(N);
  sort(W.begin(), W.end());
  for (int i=0; i<N-1; i++) {presum[i+1] = presum[i] + W[i];}
  reverse(presum.begin(), presum.end());
  return presum;
}

• 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