| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 364791 | wind_reaper | Carnival Tickets (IOI20_tickets) | C++17 | 0 ms | 0 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 <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>> ans(n, vector<int>(m, -1));
long long a = 0;
for(int i = 0; i < n; i++){
for(int j = m-1; j >= m-k; --j){
ans[i][j] = (m-1-j);
a += 1LL*x[i][j];
}
}
vector<array<int, 4>> b;
for(int i = 0; i < n; i++){
for(int j = 0; j < k; j++)
for(int w = m-1; w >= m-k; --w)
if(i == j){
b.push_back({0, i, j, w});
continue;
}
b.push_back({x[i][j] + x[i][w], i, j, w});
}
sort(b.begin(), b.end());
for(auto& [red, row, mn, mx] : b){
if(ans[row][mx] == -1 || ans[row][mn] != -1)
continue;
a -= 1LL*red;
swap(ans[row][mx], ans[row][mn]);
}
allocate_tickets(ans);
return a;
}
/*
for every i, j < k exchange the i th minimum and j th maximum
each exchange costs x[i] + x[j] ... take the first nk/2 valid exchanges
the actual order of the stuff doesnt matter
you wanna choose nk/2 pairs to remove
what happens when the stuff starts to overlap
...|..|...
..|.|..
*/