Submission #301054

#	Time	Username	Problem	Language	Result	Execution time	Memory
301054		Nucleist	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define sz(x) x.size()
#define ve vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
long long find_maximum(int k,vector<vector<int>> x) {
	int n=sz(x);
	ve cur;
	for (int i = 0; i < n; ++i)
	{
		cur.pb(x[i][0]);
	}
	sort(all(cur));
	int in=cur[n/2];
	int ans=0;
	for(auto it:cur){
		ans+=abs(it-in);
	}
	vector<ve>ani;
	ani.resize(n);
	for (int i = 0; i < n; ++i)
	{
		ani[i].pb(0);
	}
	allocate_tickets(ani);
	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