Submission #301639

#	Time	Username	Problem	Language	Result	Execution time	Memory
301639		maximath_1	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	256 KiB

tickets

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

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	vector<int> cr;
	for(int i = 0; i < n; i ++)
		cr.push_back(x[i][0]);
	sort(cr.begin(), cr.end());
	int ans = 0;
	for(int i = 0; i < n; i ++)
		ans += abs(cr[i] - cr[n / 2]);

	vector<vector<int> > as;
	as.resize(n);
	for(int i = 0; i < n; i ++)
		as[i].push_back(0);
	allocate_tickets(as);
	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