Submission #554146

#	Time	Username	Problem	Language	Result	Execution time	Memory
554146		Zhora_004	Road Closures (APIO21_roads)	C++17	5 / 100	72 ms	6860 KiB

roads

#include "roads.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#include <fstream>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
/*ofstream fout("timeline.out");
ifstream fin("timeline.in");*/
using ll = long long;
using namespace std;
int n;
vector<int> a, b, c;

bool task(int id)
{
	if (id == 1)
	{
		for (int& i : a) if (i) return 0;
		return 1;
	}
	return 0;
}

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	a = U;
	b = V;
	c = W;
	if (task(1))
	{
		vector<ll> res;
		ll sum = 0;
		for (int& i : c) sum += i;
		res.push_back(sum);
		sort(c.begin(), c.end());
		reverse(c.begin(), c.end());
		for (int k = 0; k < n - 1; k++)
		{
			sum -= c[k];
			res.push_back(sum);
		}
		return res;
	}
}

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:69:1: warning: control reaches end of non-void function [-Wreturn-type]
   69 | }
      | ^

• 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