# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114960 | epicci23 | 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"
#define ll long long
#define all(v) v.begin() , v.end()
#define sz(a) (ll)a.size()
using namespace std;
const ll N = 2500;
ll find_maximum(int _k, vector<vector<int>> _x){
ll n=sz(_x),m=sz(_x[0]),k=_k;
ll ar[n+5][m+5],l[n+5],r[n+5],ans=0;
vector<vector<int>> ANS(n,vector<int>(m,-1));
for(ll i=1;i<=n;i++) for(ll j=1;j<=m;j++) ar[i][j] = _x[i-1][j-1];
vector<int> cnt[n+5][2];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++) cnt[i][ar[i][j]].push_back(j);
}
vector<int> hm;
for(int i=1;i<=n;i++) hm.push_back(i);
for(int i=0;i<k;i++){
int p = n;
sort(all(hm),[&](int a,int b){
return sz(cnt[a][1]) > sz(cnt[b][1]);