Submission #1205211

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205211		ansori	Carnival Tickets (IOI20_tickets)	C++20	11 / 100	1 ms	836 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
void allocate_tickets(vector<vector<int>> _d) ;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<std::vector<int>> answ(n , vector<int> (m , -1));
	vector<pair<int , pair<int , int>>> vc;
	for(int i = 0;i < n; ++ i){
		for(int j = 0;j < m; ++ j) vc.push_back({x[i][j] , {i , j}});
	}
	sort(vc.rbegin() , vc.rend());
	long long ans = 0;
	vector<int> cnt(n + 1);
	int i = -1 , kol = 0;
	while(kol < (n / 2) * k){
		i ++;
		cnt[vc[i].se.fi] ++;
		if(cnt[vc[i].se.fi] > k) continue ;
		ans += vc[i].fi;
		answ[vc[i].se.fi][vc[i].se.se] = cnt[vc[i].se.fi] - 1;
		kol ++;
	}
	reverse(vc.begin() , vc.end());
	i = -1 , kol = 0;
	while(kol < (n / 2) * k){
		i ++;
		cnt[vc[i].se.fi] ++;
		if(cnt[vc[i].se.fi] > k) continue ;
		ans -= vc[i].fi;
		answ[vc[i].se.fi][vc[i].se.se] = cnt[vc[i].se.fi] - 1;
		kol ++;
	}
	allocate_tickets(answ);
	return ans;
}

• Subtask 1: 11 / 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