Submission #1305321

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305321		neonglitch	Carnival Tickets (IOI20_tickets)	C++20	27 / 100	261 ms	51356 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;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m,-1);
		row[0]=0;
		answer.push_back(row);
	}
	
	vector<pair<int,int>> ord;
	
	ll sm=0;
	for(int i=0;i<n;i++)
	{
		sm-=x[i][0];
		ord.push_back({x[i][0]+x[i][m-1],i});
	}
	sort(rbegin(ord),rend(ord));
	
	for(int i=0;i<n/2;i++)
	{
		sm+=ord[i].first;
		int j=ord[i].second;
		answer[j][0]=-1;
		answer[j][m-1]=0;
	}
	allocate_tickets(answer);
	return sm;
}

// int main()
// {
	// int n,m,k;
	// cin>>n>>m>>k;
	// vector<vector<int>> x(n,vector<int>(m));
	// for(int i=0;i<n;i++)
	// {
		// for(int j=0;j<m;j++)
		// {
			// cin>>x[i][j];
		// }
	// }
	// cout<<find_maximum(k,x)<<endl;
// }

• 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