제출 #346276

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

tickets

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

ll find_maximum(int K, vector<vector<int>> X) {
	int N = X.size(), M=X[0].size();

	vector<int> T(N), L(N);
	priority_queue<pair<int, int>> pq;
	for (int i=0; i<N; i++) pq.emplace(X[i][M-1]+X[i][K-1], i);

	for (int i=0; i<K*N/2; i++) {
		int j=pq.top().second;
		pq.pop();
		T[j]++;
		if (T[j]<K)
			pq.emplace(X[j][M-1-T[j]]+X[j][K-1-T[j]], i);
	}
	
	vector<vector<int>> A;
	while (pq.size()) pq.pop();
	for (int i=0; i<N; i++)
		A.emplace_back(vector<int>(M, -1)),
		pq.emplace(T[i], i);

	int mx=0, mn=(1e9);
	for (int i=0; i<N; i++) {
		if (T[i]<K) mx=max(mx, X[i][K-T[i]-1]);
		if (T[i]) mn=min(mn, X[i][M-T[i]]);
	}
	assert(mx<=mn);

	ll R=0;
	for (int i=0; i<K; i++) {
		vector<int> S;
		for (int j=0; j<N/2; j++) S.emplace_back(pq.top().second), pq.pop();
		sort(S.begin(), S.end());
		for (int j=0, k=0; j<N; j++) {
			if (k<N/2&&j==S[k]) {
				L[j]++;
				A[j][M-L[j]]=i;
				R+=X[j][M-L[j]];
				pq.emplace(T[j]-L[j], j);
				k++;
			}
			else A[j][i-L[j]]=i, R-=X[j][i-L[j]];
		}
	}

	allocate_tickets(A);
	return R;
}

• 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