Submission #790896

#	Time	Username	Problem	Language	Result	Execution time	Memory
790896		Trumling	Carnival Tickets (IOI20_tickets)	C++14	27 / 100	407 ms	73076 KiB

tickets

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

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer(n,vector<int>(m,-1));
	priority_queue<pair<ll,ll>>pq;

	ll ans=0;
	for(int i=0;i<n;i++)
		{
			answer[i][0]=0;
			pq.push({x[i][m-1]+x[i][0],i});
			ans-=x[i][0];
		}
	
	for(int i=0;i<n/2;i++)
	{
		pair<ll,ll> curr=pq.top();
		pq.pop();
		answer[curr.S][0]=-1;
		answer[curr.S][m-1]=0;
		ans+=curr.F;
	}
	allocate_tickets(answer);

	return ans;
}

• 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