Submission #791985

#	Time	Username	Problem	Language	Result	Execution time	Memory
791985		mousebeaver	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	212 KiB

tickets

#define ll long long
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

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

	if(m == 1)
	{
		vector<vector<int>> output(n, vector<int> (1, 0));
		allocate_tickets(output);
		vector<ll> a(n);
		for(ll i = 0; i < n; i++)
		{
			a[i] = x[i][0];
		}
		sort(a.begin(), a.end());
		ll ans = 0;
		ll add = 0;
		for(ll i = n/2; i >= 0; i--)
		{
			add += a[n/2] - a[i];
			ans += add;
		}
		add = 0;
		for(ll i = n/2+1; i < n; i++)
		{
			add += a[i] - a[n/2];
			ans += add;
		}
		return ans;
	}

	return 0;
}

• 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