제출 #1057085

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057085		aufan	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	275 ms	51320 KiB

tickets

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

using namespace std;

long long find_maximum(int k, vector<vector<int>> a) {
	int n = (int)a.size(), m = (int)a[0].size();
	long long res = 0;
	vector<int> pl(n), pr(n, m - 1);
	vector<vector<int>> ans(n, vector<int>(m, -1));
	for (int i = 0; i < k; i++) {
		vector<pair<int, int>> v;
		for (int j = 0; j < n; j++) {
			res -= a[j][pl[j]];
			v.push_back({a[j][pr[j]] + a[j][pl[j]], j});
		}
		sort(v.begin(), v.end());

		for (int j = 0; j < n / 2; j++) {
			auto [x, p] = v[j];
			ans[p][pl[p]++] = i;
		}

		for (int j = n / 2; j < n; j++) {
			auto [x, p] = v[j];
			res += x;
			ans[p][pr[p]--] = i;
		}
	}

	allocate_tickets(ans);

	return res;
}

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