제출 #430566

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for (lli i = (a); i <= (b); i++)
#define repa(i,a,b) for (lli i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl;
#define debugsl(a) cout << #a << " = " << a << ", ";

lli n,m,mitad,val;
vector< vector<int> > res;
vector<int>orden;

long long find_maximum(int k, std::vector<std::vector<int>> x) {

	n = x.size();
	m = x[0].size();

	rep(i,0,n-1) orden.push_back(x[i][0]);
	sort(orden.begin(), orden.end());
	mitad = n/2;
	val = orden[mitad-1];

	lli suma = 0;
	rep(i,0,n-1) suma += abs(x[i][0] - val);

	res = vector<vector<int> > (n, vector<int> (m, 0));
	allocate_tickets(res);
	return suma;

}

• 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