Submission #830234

#	Time	Username	Problem	Language	Result	Execution time	Memory
830234		pavement	Carnival Tickets (IOI20_tickets)	C++17	25 / 100	815 ms	84448 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define eb emplace_back

using ll = long long;
using iii = tuple<int, int, int>;

ll find_maximum(int k, vector<vector<int> > x) {
	int n = x.size(), m = x[0].size();
	vector<vector<int> > out(n, vector<int>(m, 0)), add(n), sub(n);
	ll ret = 0;
	vector<iii> vals;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			vals.eb(x[i][j], i, j);
		}
	}
	sort(vals.begin(), vals.end());
	for (int i = 0; i < n * m; i++) {
		auto [_, x, y] = vals[i];
		if (i < n * m / 2) {
			sub[x].pb(y);
		} else {
			add[x].pb(y);
		}
	}
	for (int i = 0; i < m; i++) {
		vector<int> ord;
		for (int j = 0; j < n; j++) {
			ord.pb(j);
		}
		sort(ord.begin(), ord.end(), [&](const auto &lhs, const auto &rhs) {
			return sub[lhs].size() < sub[rhs].size();
		});
		vector<int> cur;
		for (int j = 0; j < n / 2; j++) {
			cur.pb(x[ord[j]][add[ord[j]].back()]);
			out[ord[j]][add[ord[j]].back()] = i;
			add[ord[j]].pop_back();
		}
		for (int j = n / 2; j < n; j++) {
			cur.pb(x[ord[j]][sub[ord[j]].back()]);
			out[ord[j]][sub[ord[j]].back()] = i;
			sub[ord[j]].pop_back();
		}
		sort(cur.begin(), cur.end());
		for (auto j : cur) {
			ret += llabs(j - cur[cur.size() / 2]);
		}
	}
	allocate_tickets(out);
	return ret;
}

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