# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875680 | abczz | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 504 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 <iostream>
#include <vector>
#include <array>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
priority_queue<array<ll, 3>> pq;
ll n = x.size(), m = x[0].size(), f = 0, s = 0, id[1500];
for (int i=0; i<n; ++i) {
for (int j=0; j<k; ++j) {
f -= x[i][j];
}
pq.push({x[i][k-1]+x[i][m-1], i, k-1});
}
for (int t=0; t<n*k/2; ++t) {
auto [w, u, v] = pq.top();
pq.pop();
f += w;
if (v) {
--v;
pq.push({x[u][v]+x[u][m-1-(k-1-v)], u, v-1});
}
}
return f;
}
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... |