| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1290107 | eri16 | Carnival Tickets (IOI20_tickets) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long fnd_ans(long long k,vector<vector<long long>> v,vector<vector<long long>> ans){
vector <long long> vv[k];
long long n=v.size();
long long m=v[0].size();
for (int i=0; i<n; i++){
for (int j=0; j<m; j++){
if (ans[i][j]!=-1){
vv[ans[i][j]].push_back(v[i][j]);
}
}
}
long long sm=0,tt;
for (int i=0; i<k; i++){
tt=vv[i][n/2LL];
for (int j=0; j<n; j++){
sm+=abs(tt-vv[i][j]);
}
}
return sm;
}
long long find_maximum(long long k, vector<vector<long long>> v){
long long n=v.size();
long long m=v[0].size();
vector<vector<long long>> ans(n);
if (m==1){
for (int i=0; i<n; i++){
ans[i].push_back(0);
}
}
allocate_tickets(ans);
return fnd_ans(k,v,ans);
}
