Submission #1360993

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360993		Jawad_Akbar_JJ	Road Closures (APIO21_roads)	C++17	5 / 100	21 ms	4656 KiB

roads

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<long long> sub1(int n, vector<int> U, vector<int> V, vector<int> W){
	sort(rbegin(W), rend(W));

	vector<long long> Ans(n, 0);
	for (int i : W)
		Ans[0] += i;
	for (int i=1;i<=W.size();i++)
		Ans[i] = Ans[i-1] - W[i-1];
	return Ans;
}

vector<long long> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W){
	bool t = 1;
	for (int i=0;i<n-1;i++)
		t &= U[i] == 0;

	if (t)
		return sub1(n, U, V, W);
	// return sub2(n, U, V, W);
}

Compilation message (stderr)

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^

• 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