제출 #578775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578775		thiago_bastos	카니발 티켓 (IOI20_tickets)	C++17	41 / 100	923 ms	84024 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<std :: pair<int, int>> a;
	std :: vector<int> l(n, m), r(n, 0), lo(n, 0), hi(n, m - 1);

	for(int i = 0; i < n; ++i)
		for(int v : x[i])
			a.emplace_back(v, i);

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

	for(int i = size(a) / 2; i < (int)size(a); ++i) {
		auto [v, k] = a[i];
		++r[k], --l[k];
	}

	for(int j = 0; j < k; ++j) {
		int L = 0, R = 0;

		for(int i = 0; i < n; ++i) {
			if(l[i] && !r[i]) {
				++L, --l[i];	
				prize -= x[i][lo[i]];
				answer[i][lo[i]++] = j;
			} else if(!l[i] && r[i]) {
				++R, --r[i];
				prize += x[i][hi[i]];
				answer[i][hi[i]--] = j;
			}
		}

		std :: vector<std :: pair<int, int>> a;

		for(int i = 0; i < n; ++i) {
			if(l[i] && r[i]) {
				prize += x[i][hi[i]];
              	a.emplace_back(-x[i][lo[i]] - x[i][hi[i]], i);
				answer[i][hi[i]--] = j;
				--r[i];
			}
		}

		std :: sort(a.rbegin(), a.rend());

		for(int i = 0; i < n / 2 - L; ++i) {
			auto [v, k] = a[i];
			prize += v;
			answer[k][++hi[k]] = -1;
			answer[k][lo[k]++] = j;
			++r[k], --l[k];
		}
	}

	allocate_tickets(answer);

	return prize;
}

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