Submission #789685

#	Time	Username	Problem	Language	Result	Execution time	Memory
789685		FEDIKUS	Carnival Tickets (IOI20_tickets)	C++17	62 / 100	3075 ms	54028 KiB

tickets

#include "tickets.h"
#include <vector>
#include<limits.h>
#include<iostream>
#include<algorithm>

using ll = long long;
using namespace std;

ll 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++) {
		vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j] = -1;
		}
		answer.push_back(row);
	}

	ll res=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++){
			res-=x[i][j];
		}
	}
	vector<int> klkp(n,0);
	for(int i=0;i<n*k/2;i++){
		pair<int,int> maxi={INT_MIN,-1};
		for(int j=0;j<n;j++){
			if(klkp[j]==k) continue;
			maxi=max(maxi,{x[j][m-1-klkp[j]]+x[j][k-1-klkp[j]],j});
		}
		res+=maxi.first;
		klkp[maxi.second]++;
	}
	vector<int> uzeop(n,0);
	bool uspeo=true;
	for(int i=0;i<k;i++){
		vector<pair<int,int> > sta(n,{0,0});
		for(int j=0;j<n;j++){
			sta[j]={-klkp[j]+uzeop[j],j};
		}
		vector<bool> uzimamp(n,false);
		sort(sta.begin(),sta.end());
		for(int i=0;i<n/2;i++){
			uzimamp[sta[i].second]=true;
		}
		for(int j=0;j<n;j++){
			if(uzimamp[j]){
				answer[j][m-1-uzeop[j]]=i;
				uzeop[j]++;
			}else{
				answer[j][i-uzeop[j]]=i;
			}
		}
	}
	for(int i=0;i<n;i++) if(uzeop[i]!=klkp[i]) uspeo=false;
	if(!uspeo) exit(-1);
	allocate_tickets(answer);
	return res;
}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23
• Subtask 7: 0 / 10