Submission #1048828

#	Time	Username	Problem	Language	Result	Execution time	Memory
1048828		IUA_Hasin	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	700 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>

#define ll							long long	

using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	ll n = x.size();
	ll arr[n];
	for(int i=0; i<n; i++){
		arr[i] = x[i][0];
	}

	sort(arr, arr+n);
	ll mx = 0;
	ll ind;
	if(n%2==0){
		ind = n/2-1;
	} else {
		ind = n/2;
	}
	ll a = arr[ind];
	for(int i=0; i<n; i++){
		ll temp = abs(arr[i]-a);
		mx = mx+temp;
	}
	vector<vector<int>> answer;
	for(int i=0; i<n; i++){
		answer.push_back({0});
	}
	allocate_tickets(answer);
	return mx;
}

// 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);
// 		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 1;
// }

• 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