제출 #691257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691257		zeroesandones	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	1 ms	724 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

using ll = long long;
using vi = vector<long long>;

#define pb emplace_back

ll calc(vector<vector<int>>& x, int col, int n) {
	vi curr;
	for(int i = 0; i < n; ++i) {
		curr.pb(x[i][col]);
	}

	sort(curr.begin(), curr.end());
	ll N = curr.size();
	return ((curr[N / 2] + curr[N / 2 - 1]) / 2);
}

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n, vector<int>(m));

	for(int i = 0; i < n; ++i)
		answer[i][0] = 0;

	allocate_tickets(answer);

	ll med = calc(x, 0, n);
	ll res = 0;
	for(int i = 0; i < n; ++i) {
		res += abs(x[i][0] - med);
	}

	return res;
}

• 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