| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1294622 | daotuankhoi | 카니발 티켓 (IOI20_tickets) | C++20 | 0 ms | 0 KiB |
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> answer(n, vector<int>(m));
vector<vector<bool>> mark(n, vector<bool>(k));
vector<pair<long long, int>> val;
vector<int> big(n, k), small(n, 0);
long long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = m - k; j < m; j++) {
sum += x[i][j];
val.emplace_back(x[i][j] + x[i][j - m + k], i);
}
}
sort(val.begin(), val.end());
for (int i = 0; i < ((n * k) >> 1); i++) {
sum -= val[i].first;
big[val[i].second]--;
small[val[i].second]++;
}
int gr = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < small[i]; j++) {
answer[i][j] = gr
mark[i][gr] = 1;
gr = (gr + 1) % k;
}
}
for (int i = 0; i < n; i++) {
for (int j = m - big[i], t = 0; j < m; j++) {
while (mark[i][t]) t++;
answer[i][j] = t++;
}
}
allocate_tickets(answer);
return sum;
}
