# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017726 | ZeroCool | Carnival Tickets (IOI20_tickets) | C++14 | 24 ms | 3300 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 <vector>
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define int long long
long long find_maximum(signed k, std::vector<std::vector<signed>> A) {
int n = A.size();
int m = A[0].size();
vector<vector<signed> > res(n, vector<signed>(m, -1));
int ans = 0;
int cnt[n];
priority_queue<ar<int, 2> > pq;
for(int i = 0;i < n;i++){
cnt[i] = k - 1;
for(int j = 0;j < k;j++)ans -= A[i][j];
pq.push({A[i][k-1] + A[i][m-1], i});
}
for(int it = 0;it < n * k / 2;it++){
int x = pq.top()[0];
int i = pq.top()[1];
pq.pop();
ans += x;
if(cnt[i] == 0)continue;
--cnt[i];
pq.push({A[i][cnt[i]] + A[i][m - k + cnt[i]], i});
}
int r = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j <= cnt[i];j++)res[i][j] = (r++) % k;
int t = r;
for(int j = cnt[i] + 1;j < m;j++)res[i][j] = (t++) % k;
}
allocate_tickets(res);
return ans;
}
#define int signed
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... |