# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418677 | dxz05 | Carnival Tickets (IOI20_tickets) | C++14 | 2 ms | 716 KiB |
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 3e2;
long long min_ans(vector<int> a){
sort(a.begin(), a.end());
ll res = 0;
for (int i = 0; i < a.size(); i++){
res += abs(a[i] - a[a.size() / 2]);
}
return res;
}
long long 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, -1));
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
answer[i][j] = j;
}
}
vector<int> v;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) v.push_back(X[i][j]);
}
allocate_tickets(answer);
return min_ans(v);
}
Compilation message (stderr)
# | 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... |