# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300173 | model_code | Carnival Tickets (IOI20_tickets) | C++17 | 1199 ms | 63212 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.
// sy-full
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> pii;
long long find_maximum(int k, vector<vector<int>> d) {
// Number of companies
int c = d.size();
// tickets per company
int s = d[0].size();
// Sort each company's tickets by their distance
// o[company][place] => index of ship which is <place>th from left
vector<vector<int>> o;
o.resize(c);
for (int i = 0; i < c; i++) {
o[i].resize(s);
for (int j = 0; j < s; j++) {
o[i][j] = j;
}
sort(o[i].begin(), o[i].end(), [&](const int &a, const int &b) {
return d[i][a] < d[i][b];
});
}
# | 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... |