제출 #365181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365181		dolphingarlic	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	1034 ms	94952 KiB

tickets

#include "tickets.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

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

	vector<vector<int>> le(n), gr(n);
	vector<int> lcnt(n, k), gcnt(n);
	priority_queue<pair<int, int>> pq;
	ll val = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < k; j++) {
			le[i].push_back(x[i][j]);
			val -= x[i][j];
		}
		pq.push({x[i][m - 1] + x[i][k - 1], i});
	}
	for (int _ = 0; _ < n * k / 2; _++) {
		val += pq.top().first;
		int i = pq.top().second;
		pq.pop();
		le[i].pop_back();
		gr[i].push_back(x[i][m - gcnt[i] - 1]);
		lcnt[i]--, gcnt[i]++;
		if (lcnt[i]) pq.push({x[i][m - gcnt[i] - 1] + x[i][lcnt[i] - 1], i});
	}


	vector<vector<int>> alloc(n, vector<int>(m, -1));
	while (pq.size()) pq.pop();
	for (int i = 0; i < n; i++) pq.push({gcnt[i], i});
	for (int i = 0; i < k; i++) {
		vector<bool> used(n);
		for (int j = 0; j < n / 2; j++) {
			int idx = pq.top().second;
			pq.pop();
			alloc[idx][m - gcnt[idx] + gr[idx].size() - 1] = i;
			gr[idx].pop_back();
			used[idx] = true;
		}
		for (int j = 0; j < n; j++) {
			if (!used[j]) {
				alloc[j][le[j].size() - 1] = i;
				le[j].pop_back();
			} else pq.push({gr[j].size(), j});
		}
	}

	allocate_tickets(alloc);
	return val;
}

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