Submission #570239

#	Time	Username	Problem	Language	Result	Execution time	Memory
570239		ChrisM2309	Road Closures (APIO21_roads)	C++14	0 / 100	43 ms	3732 KiB

roads

#include "roads.h"

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<ii> vii; 
typedef vector<vii> wgraf;
typedef pair<int,ii> edge;

#define UNVISITED 0
#define VISITED 1
#define INF 1000000000
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	vector<ll> ans;
	
	sort(all(W),greater<ll>());
	ll sum = 0;

	for (auto i : W){
		sum += i;
		ans.pb(sum);
	}
	reverse(all(ans));
	ans.pb(0);
  return ans;
}

• Subtask 1: 0 / 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