# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928138 | SUNWOOOOOOOO | Carnival Tickets (IOI20_tickets) | C++17 | 1 ms | 348 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;
using LL = long long;
LL find_maximum(int k, vector<vector<int>> x) {
int n = x.size(), m = x[0].size();
LL ans = 0;
for (int i = 0; i < n; i++){
LL sum = 0;
for (int j = 0; j < n; j++) sum += abs(x[j][0] - x[i][0]);
ans = min(ans, sum);
}
vector<vector<int>> S;
for (int i = 0; i < n; i++) S.push_back({0});
allocate_tickets(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... |