Submission #302313

#	Time	Username	Problem	Language	Result	Execution time	Memory
302313		arnold518	Carnival Tickets (IOI20_tickets)	C++14	25 / 100	1204 ms	80052 KiB

tickets

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1500;

int N, M, K;
int A[MAXN+10][MAXN+10];
int P[MAXN+10];
int ans2[MAXN+10][MAXN+10];
ll ans;

int L[MAXN+10], R[MAXN+10], chk[MAXN+10];

ll find_maximum(int _K, vector<vector<int>> _X)
{
	N=_X.size(); M=_X[0].size(); K=_K;
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) A[i][j]=_X[i-1][j-1];

	for(int i=1; i<=N; i++) P[i]=0;

	vector<pii> V;
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) V.push_back({A[i][j], i});
	sort(V.begin(), V.end());

	for(int i=0; i<N*M/2; i++)
	{
		int now=V[i].second;
		P[now]++;
	}

	int cnt=0;
	for(int i=1; i<=N; i++) if(P[i]==0) cnt++;

	priority_queue<pii> PQ1; priority_queue<pii> PQ2;
	for(int i=1; i<=N; i++) if(P[i]>1) PQ1.push({A[i][P[i]], i});
	for(int i=1; i<=N; i++) if(P[i]==0) PQ2.push({-A[i][1], i});
	while(cnt>N/2)
	{
		pii now=PQ1.top(); PQ1.pop();
		pii now2=PQ2.top(); PQ2.pop();
		P[now.second]--; cnt--;
		P[now2.second]++;
		if(P[now.second]>1) PQ1.push({A[now.second][P[now.second]], now.second});
	}

	for(int i=1; i<=N; i++) L[i]=1, R[i]=P[i]+1;
	for(int i=1; i<=K; i++)
	{
		vector<pii> V;
		for(int j=1; j<=N; j++) if(L[j]<=P[j]) V.push_back({-P[j]+L[j], j});
		sort(V.begin(), V.end());



		for(int j=1; j<=N; j++) chk[j]=0;
		for(int j=0; j<N/2; j++) chk[V[j].second]=1;
 
		for(int j=1; j<=N; j++)
		{
			if(!chk[j])
			{
				ans+=A[j][R[j]];
				ans2[j][R[j]]=i;
				R[j]++;
			}
			else
			{
				ans-=A[j][L[j]];
				ans2[j][L[j]]=i;
				L[j]++;
			}
		}
	}

	vector<vector<int>> answer;
	answer=vector<vector<int>>(N, vector<int>(M));
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) answer[i-1][j-1]=ans2[i][j]-1;
	allocate_tickets(answer);
	return ans;
}

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