# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300538 | Muhammetali | 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 "tickets.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
long long find_maximum(int k, std::vector<std::vector<int>> x)
{
int n=x.size();
int m=x[0].size();
vector<vi> answer;
for(int i=0;i<n;i++) answer.push_back(0);
allocate_tickets(answer);
vi v;
for (int i=0;i<n;i++) v.pb(x[i][0]);
int mid=n/2;
if (n%2==0)
{
ll k=v[mid+1]+v[mid]/2;
mid=k;
}
else mid=v[mid];
ll res=0;
for (int i=0;i<n;i++) res+=abs(v[i]-mid);
return res;
}