Submission #429493

#	Time	Username	Problem	Language	Result	Execution time	Memory
429493		MrFrancho	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	292 KiB

tickets

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

using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n);
	if(m == 1) {
		vector<int> p;
		for (int i = 0; i < n; i++) {
			answer[i].push_back(0);
			p.push_back(x[i][0]);
		}
		sort(p.begin(), p.end());
		int median = floor((p[n/2]+p[n/2-1])/2), val = 0;
		for (int i = 0; i < n; i++) {
			val += abs(median-p[i]);
		}
		allocate_tickets(answer);
		return val;
	}
	else {
		for (int i = 0; i < n; i++) {
			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: 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