Submission #305608

#	Time	Username	Problem	Language	Result	Execution time	Memory
305608		Lawliet	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	768 ms	51576 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

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

	vector< vector<int> > answer;

	for(int i = 0; i < n; i++) 
		answer.push_back( vector<int>( m , -1 ) );

	lli ans = 0;
	vector< pair<lli,int> > sum;

	for(int i = 0 ; i < n ; i++)
	{
		ans -= x[i][0];
		answer[i][0] = 0;
		sum.push_back( { x[i][0] + x[i].back() , i } );
	}

	sort( sum.begin() , sum.end() );

	while( (int)sum.size() > n/2 )
	{
		int ind = sum.back().second;
		sum.pop_back();

		answer[ind][0] = -1;
		answer[ind].back() = 0;

		ans += x[ind][0] + x[ind].back();
	}

	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