Submission #300879

#TimeUsernameProblemLanguageResultExecution timeMemory
300879luciocfCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms256 KiB
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long ll;

const int maxn = 1510;

int a[maxn];

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

	vector<vector<int>> S;
	
	for (int i = 0; i < n; i++)
	{
		vector<int> x;
		x.resize(m);
		x[0] = 0;

		S.push_back(x);
	}

	allocate_tickets(S);

	int med = a[n/2][0];
	ll ans = 0;

	for (int i = 0; i <= n/2; i++)
		ans += 1ll*(med-a[i][0]);
	for (int i = n/2 + 1; i < n; i++)
		ans += 1ll*(a[i][0]-med);

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...