Submission #603485

#	Time	Username	Problem	Language	Result	Execution time	Memory
603485		Tigryonochekk	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	1 ms	212 KiB

tickets

#include <iostream>
#include <algorithm>
#include "tickets.h"
#include <vector>
#define ll long long
using namespace std;
const ll inf = 1e18 + 69;

vector<vector<int>> answer;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	answer.resize(n);
	ll ans = inf;
	for (int i = 0; i < n; i++) {
		answer.resize(m);
	}
	if (m == 1) {
		ll sum = 0;
		for (int i = 0; i < n; i++) {
			sum += x[i][0];
		}
		sum /= n;
		ll dif = 0;
		for (int i = 0; i < n; i++) {
			dif += abs(sum - x[i][0]);
		}
		ans = min(ans, dif);
		sum++;
		dif = 0;
		for (int i = 0; i < n; i++) {
			dif += abs(sum - x[i][0]);
		}
		ans = min(ans, dif);
	}
	allocate_tickets(answer);
	return ans;
}

• 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