Submission #1320484

#TimeUsernameProblemLanguageResultExecution timeMemory
1320484nicolo_010Carnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

ll calc(vector<int> &a, int b) {
	ll sum=0;
	for (auto x : a) {
		sum += abs(x-b);
	}
	return sum;
}

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> s(n, vector<int>(m, -1));
	ll md;
	for (int i=0; i<n; i++) {
		s[i][0] = 0;
	}
	md = x[n/2][0] + x[n/2-1][0];
	md /= 2;
	allocate_tickets(s);
	vector<int> a(n);
	for (int i=0; i<n; i++) {
		a[i] = x[i][0];
	}
	return calc(a, md);
}
#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...