제출 #346355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346355		dennisstar	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	1004 ms	54436 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]], j);
	}
	
	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);
 
	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]) {
				R+=X[j][M-1-L[j]];
				A[j][M-1-L[j]]=i;
				L[j]++;
				if (L[j]<T[j])
					pq.emplace(T[j]-L[j], j);
				k++;
			}
			else
				R-=X[j][i-L[j]],
				A[j][i-L[j]]=i;
		}
	}
 
	allocate_tickets(A);
	return R;
}

• 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