제출 #1015543

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015543		Unforgettablepl	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	465 ms	76116 KiB

tickets

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
void allocate_tickets( std::vector<std::vector<int>> _x);
 
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> anss(n,vector<int>(m,-1));
	ll ans=0;
	vector<int> status(n,k-1);
	priority_queue<pair<ll,ll>> deltaq;
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++)ans-=x[i][j];
		deltaq.emplace(x[i][k-1]+x[i][m-1],i);
	}
	for(int i=0;i<(n/2)*k;i++){
		auto [change,idx] = deltaq.top();deltaq.pop();
		ans+=change;
		status[idx]--;
		if(status[idx]==-1)continue;
		deltaq.emplace(x[idx][status[idx]]+x[idx][m-k+status[idx]],idx);
	}
	int round = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<=status[i];j++)anss[i][j]=(round++)%k;
		int t = round;
		for(int j=m-k+status[i]+1;j<m;j++)anss[i][j]=(t++)%k;
	}
	allocate_tickets(anss);
	return ans;
}

• 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