제출 #779184

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

tickets

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

using namespace std;

#define int long long

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

	int res = 0;

	assert(m == 1);

	vector<signed> vals = x[0];
	sort(vals.begin(), vals.end());

	int med = vals[n/2];


	for (int i: vals) res += abs(i-med);
	

	vector<vector<signed>> cards(m, vector<signed>(n));

	for (int i=0; i<n; i++) {
		cards[0][0] = 0;
	}


	allocate_tickets(cards);
	return res;
}

• 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