| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 303674 | medmdg | 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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long int fin(vector<vector<int> > a,int n,int m,int k){
for(int i=0;i<n;i++){
sort(a[i].begin(),a[i].end());
}
long long int ans=0;
for(int i=0;i<n;i++){
long long int ff=a[i][(m)/2];
for(int j=0;j<m;j++){
ans+=(long long int)(abs(ff-a[i][j]));
}
}
return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
int n=x.size();
int m=x[0].size();
if(m==1){
vector<vector<int> > ans(n);
vector<vector<int> > answ(k);
for(int i=0;i<n;i++){
ans[i].push_back(0);
answ[0].push_back(x[i][0]);
}
allocate_tickets(ans);
return fin(answ,k,n,k);
}
if(k==1){
vector<vector<int> > a(k);
vector<vector<int> > b(n);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
b[i][j]=-1;
int mi[n];
int ma[n];
for(int i=0;i<n;i++){
mi[i]=0;
ma[i]=m-1;
}
vector<pair<int,int> > mini;
vector<pair<int,int> > maxi;
for(int i=0;i<n;i++){
pair<int,int > v;
v.first=a[i][mi[i]];
v.second=i;
mini.push_back(v);
v.first=a[i][ma[i]];
v.second=i;
maxi.push_back(v);
}
sort(mini.begin(),mini.end());
sort(maxi.begin(),maxi.end());
for(int i=0;i<n/2;i++){
a.push_back(mini[i].first);
a.push_back(maxi[n-i-1].first);
b[mini[i].second]++;
b[maxi[i].second]++;
}
allocate_tickets(b);
return fin(a,k,n,k);
}
}