Submission #1289684

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289684		bilgun	Carnival Tickets (IOI20_tickets)	C++20	11 / 100	2 ms	836 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;

long long find_maximum(int k, vector<vector<int>> vec) {
	long long n = vec.size(), m = vec[0].size();
	
	if( m == 1) {
	    vector<vector<int>> ans(n);
		vector<long long> col;
		long long count = 0, s = 0;
		for( int i = 0; i < n; i++) {
			ans[i].push_back(0);
			col.push_back(vec[i][0]);
		}
		sort(col.begin(), col.end());
		long long mid = col[n/2];
		for( int i = 0; i < n; i++) {
			s += abs(vec[i][0] - mid);
		}
		allocate_tickets(ans);
		return s;
	}
	int s = 0;
	vector<vector<int>> ans(n, vector<int>(m, -1));
	
	for( int i = 0; i < n; i++){
	       sort( vec[i].begin(), vec[i].end());
	}
	   
	for( int j = 0; j < k; j++){
	    int tr = 0;
	   for( int i = 0; i < n; i++){
	       tr += vec[i][j];
	       ans[i][j] = j;
	   }
	   if(tr > n/2) s+= n - n/2;
	   else s += n/2;
	}
	allocate_tickets(ans);
	return s;
}

• 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