# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1065818 | allin27x | Carnival Tickets (IOI20_tickets) | C++17 | 0 ms | 604 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 <bits/stdc++.h>
using namespace std;
#define int long long
void allocate_tickets(vector<vector<signed>> s);
int find_maximum(signed k, vector<vector<signed>> x) {
int n = x.size(); int m = x[0].size();
vector<vector<signed>> s(n, vector<signed>(m));
if (m==1) {
for (int i=0; i<n; i++) s[i][0]=0; allocate_tickets((s));
int md = x[n/2][0];
int s = 0; for (int i=0; i<n; i++) s += abs(x[i][0]-md);
return s;
}
return 0;
}
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... |