# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955059 | Trisanu_Das | 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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
const int N=1505;
int n, m, d[N], s[N];
long long sum;
vector<pair<int, int> > v, l;
long long find_maximum(int k, vector<vector<int> > x){
n = x.size(); m = x[0].size();
vector<vector<int> > ans(n, vec(m, -1));
for(int i = 0; i < n; i++){
for(int j = 0; j < k; j++) {
sum += x[i][m - 1 - j];
v.push_back(make_pair(x[i][j] + x[i][m - k + j], i));
}
}
sort(v.begin(), v.end());
for(int i = 0; i < n * k / 2; i++) {
sum -= v[i].first;
d[v[i].second]++;
}
for(int i = 0; i < n; i++){
l.clear();
for(int j = 0; j < k; j++) l.push_back(make_pair(s[j], j));
sort(l.begin(), l.end());
for(int j = 0; j < k; j++){
if(j < d[i]) {
ans[i][j] = l[j].second;
s[l[j].second]++;
} else ans[i][m - k + j] = l[j].second;
}
}
allocate_tickets(ans);
return sum;
}