Submission #1305409

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305409		neonglitch	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	1 ms	400 KiB

tickets

#include "tickets.h"
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	
	std::vector<std::vector<int>> answer(n,vector<int>(m,-1));
	ll ans=0;
	vector<pair<ll,int>> pos;

	for(int i=0;i<n;i++)
	{
		for(int j=0;j<k;j++)
		{
			ans-=x[i][j];
			pos.push_back({x[i][j]+x[i][m-k+j],i});
		}
	}
	vector<int> cnt(n+2);
	sort(rbegin(pos),rend(pos));
	for(int i=0;i<(n*k)/2;i++)
	{
		ans+=pos[i].first;
		cnt[pos[i].first]++;
	}
	int l=0;
	int r=k-1;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<cnt[i];j++)
		{
			answer[i][j]=(l++)%k;
		}
		for(int j=0;j<cnt[i];j++)
		{
			answer[i][m-1-j]=((r--)%k+k)%k;
		}
	}
	allocate_tickets(answer);
	return ans;
}

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