| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301538 | qiangbao | Carnival Tickets (IOI20_tickets) | C++14 | 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 <iostream>
#include <algorithm>
#include <vector>
#include "tickets.h"
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
ll n, m, kk;
vector<vector<ll> > a;
ll beg[1501], endi[1501];
vector<pii> subt;
ll ansval=0;
vector<ll> plamt;
vector<vector<int> > ans;
ll find_maximum(ll kkk, vector<vector<ll> > x)
{
ll i, j;
n=x.size(), m=x[1].size(), kk=kkk;
a=x;
for(i=0;i<m;i++)
plamt.pb(0);
for(i=0;i<n;i++)
ans.pb(plamt);
for(i=0;i<n;i++)
sort(a[i].begin(), a[i].end());
for(i=0;i<n;i++)
endi[i]=m-1;
for(i=0;i<kk;i++){
subt.clear();
for(j=0;j<n;j++){
ansval+=a[j][endi[j]];
subt.pb({a[j][endi[j]]+a[j][beg[j]], j});
}
sort(subt.begin(), subt.end());
for(j=0;j<n/2;j++){
ansval-=subt[j].first;
ans[j][beg[j]]=i;
beg[subt[j].second]++;
}
for(j=n/2;j<n;j++){
ans[j][endi[j]]=i;
endi[subt[j].second]--;
}
}
allocate_tickets(ans);
return ansval;
}