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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;
using vi = vector<long long>;
#define pb emplace_back
ll calc(vector<vector<int>>& x, int col, int n) {
vi curr;
for(int i = 0; i < n; ++i) {
curr.pb(x[i][col]);
}
sort(curr.begin(), curr.end());
ll N = curr.size();
return ((curr[N / 2] + curr[N / 2 - 1]) / 2);
}
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer(n, vector<int>(m));
for(int i = 0; i < n; ++i)
answer[i][0] = 0;
allocate_tickets(answer);
ll med = calc(x, 0, n);
ll res = 0;
for(int i = 0; i < n; ++i) {
res += abs(x[i][0] - med);
}
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... |