Submission #578776

#	Time	Username	Problem	Language	Result	Execution time	Memory
578776		thiago_bastos	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	1 ms	212 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
#include <utility>

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	long long prize = 0;

	auto answer = std :: vector<std :: vector<int>>(n, std :: vector<int>(m, -1));

	std :: vector<int> a;

	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < k; ++j) a.push_back(x[i][m - k + j] + x[i][j]);
		for(int j = m - k; j < m; ++j) prize += x[i][j];
	}

	std :: sort(a.begin(), a.end());

	for(int i = 0; i < n * k / 2; ++i) prize -= a[i];

	allocate_tickets(answer);

	return prize;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10