# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635134 | tabr | Carnival Tickets (IOI20_tickets) | C++17 | 1 ms | 300 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;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
#ifdef tabr
void allocate_tickets(vector<vector<int>>) {}
#else
#include "tickets.h"
#endif
long long find_maximum(int k, vector<vector<int>> x) {
int n = (int) x.size();
int m = (int) x[0].size();
vector<pair<int, int>> a;
long long res = 0;
for (int i = 0; i < n; i++) {
res -= accumulate(x[i].begin(), x[i].begin() + k, 0LL);
for (int j = 0; j < k; j++) {
a.emplace_back(x[i][m - 1 - j] + x[i][k - 1 - j], i);
}
}
sort(a.rbegin(), a.rend());
vector<int> big(n), small(n, k);
for (int i = 0; i < n * k / 2; i++) {
res += a[i].first;
big[a[i].second]++;
# | 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... |