Submission #1077347

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077347		mindiyak	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	604 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;

ll find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll val = 1e18;
	std::vector<std::vector<int>> answer;
	vector<int> temp;
	
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m,-1);
		row[0] = 0;
		temp.push_back(x[i][0]);
		answer.push_back(row);
	}

	sort(temp.begin(),temp.end());

	int mid = (n/2)-1;
	ll midV = temp[mid] + temp[mid+1];
	for(int j=0;j<2;j++){
		ll cur = 0;
		for (int i = 0; i < n; i++) cur += abs((midV+j) - temp[i]);
		val = min(val,cur);
	}

	allocate_tickets(answer);
	return val;
}

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