This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "tickets.h"
#include <algorithm>
#include <cassert>
#include <vector>
long long find_maximum(int numRounds, std::vector<std::vector<int>> ticket) {
const int length = ticket.size();
const int numColors = ticket[0].size();
auto answer = std::vector<std::vector<int>>(length, std::vector<int>(numColors, -1));
assert(numColors == 1);
auto values = std::vector<int>();
for (int i = 0; i < length; ++i) {
values.push_back(ticket[i][0]);
answer[i][0] = 0;
}
std::sort(values.begin(), values.end());
int b = values[length / 2];
long long res = 0;
for (auto x : values) res += llabs(x - b);
allocate_tickets(answer);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |