Submission #302914

#	Time	Username	Problem	Language	Result	Execution time	Memory
302914		8e7	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include "tickets.h"
#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
ll ab(ll a) {
	return a > 0 ? a : -a;
}
long long find_maximum(int k, vector<vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	//cout << n << ' ' << m;
	int med = n % 2 ? x[n / 2][0] : (x[n / 2][0] + x[n / 2 + 1][0]) / 2;
	//cout << med << " " << endl;
	vector<vector<int> > answer;
	ll val = 0;
	for (int i = 0; i < n; i++) {
		vector<int> row(m);
		for (int j = 0; j < m; j++) {
			//cout << x[i][j] << " ";
			if (j < k) {
				row[j] = j;
				val += ab(med - x[i][j]);
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	med++;
	ll v2 = 0;
	for (int j = 0; j < n; j++) {
		v2 += ab(med - x[j][0]);
	}
	allocate_tickets(answer);
	return min(val, v2);
}
/*
5 1 1
1
2
5
9
10
 */

• 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