Submission #1050339

#	Time	Username	Problem	Language	Result	Execution time	Memory
1050339		mychecksedad	Carnival Tickets (IOI20_tickets)	C++17	25 / 100	949 ms	98508 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(),x.end()

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));

	vector<array<int, 3>> a;	
	for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) a.pb({x[i][j], i, j});
	sort(all(a));

	vector<vector<vector<pair<int,int>>>> C(n, vector<vector<pair<int,int>>>(2));

	// ll val = 0;
	for(int i = 0; i < n*m; ++i){
		if(i < n*m/2){
			// val -= a[i][0];
			C[a[i][1]][0].pb({a[i][0], a[i][2]});
		}else{
			// val += a[i][0];
			C[a[i][1]][1].pb({a[i][0], a[i][2]});
		}
	}
	for(int i = 0; i < n; ++i){
		sort(all(C[i][0]), greater<pair<int,int>>());
		sort(all(C[i][1]));
	}

	// cout << "f" << endl;
	ll val = 0;
	for(int i = 0; i < k; ++i){
		set<pair<int, int>> S;
		for(int i = 0; i < n; ++i){
			ll dif;
			if(C[i][0].empty()) dif = INT_MAX;
			else if(C[i][1].empty()) dif = 0;
			else dif = C[i][1].back().first - C[i][0].back().first;
			S.insert({dif, i});
		}
		int cur =0 ;
		auto it = S.begin();
		vector<ll> tot;
		while(it != S.end()){
			int v =  (*it).second;
			if(cur < n/2){
				tot.pb(x[v][C[v][0].back().second]);
				answer[v][C[v][0].back().second] = i;
				C[v][0].pop_back();
			}else{
				tot.pb(x[v][C[v][1].back().second]);
				answer[v][C[v][1].back().second] = i;
				C[v][1].pop_back();
			}
			++cur;
			it = next(it);
		}
		sort(all(tot));
		for(int j = 0; j < n/2; ++j){
			val += tot[j + n/2] - tot[j];
		}
		// cout << "f" << endl;
	}

	

	// for (int i = 0; i < n; i++) {
	// 	std::vector<int> row(m);
	// 	for (int j = 0; j < m; j++) {
	// 		if (j < k) {
	// 			row[j] = j;
	// 		} else {
	// 			row[j] = -1;
	// 		}
	// 	}
	// 	answer.push_back(row);
	// }
	allocate_tickets(answer);
	return val;
}

• 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