Submission #1204869

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204869		bangan	Carnival Tickets (IOI20_tickets)	C++20	11 / 100	1 ms	580 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using i64 = long long;

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

	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		answer.push_back({0});
	}
	allocate_tickets(answer);

	// i64 min = x[0][0], max = x[0][0];
	// for (int i = 0; i < n; i++) {
	// 	min = std::min(min, i64(x[i][0]));
	// 	max = std::max(max, i64(x[i][0]));
	// }

	// i64 mid = (max + min) / 2, S = 0;
	// for (int i = 0; i < n; i++) {
	// 	S += std::abs(x[i][0] - mid);
	// }

	std::sort(x.begin(), x.end());
	i64 b = (n % 2 == 1 ? x[n / 2][0] : (x[n / 2][0] + x[n / 2 - 1][0]) / 2);
	i64 S = 0;

	for (int i = 0; i < n; i++) {
		S += std::abs(x[i][0] - b);
	}
	return S;
}

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