제출 #386030

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

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
#define int long long
using namespace std;

int median(vector<int> vec)
{
	sort(vec.begin(), vec.end());
	return vec[vec.size() / 2];
}

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

	vector<int> vec(n);
	for(int i = 0; i < n; i ++) vec[i] = x[i][0];

	int med = median(vec);

	int ans = 0;

	for(int i = 0; i < n; i ++) ans += abs(med - vec[i]);
	
	vector<vector<signed> > ansvec(n, vector<signed> (m, 0));

	allocate_tickets(ansvec);
	return ans;
}

• 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