Submission #300543

#	Time	Username	Problem	Language	Result	Execution time	Memory
300543		Muhammetali	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	256 KiB

tickets

#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, vector<vi> x)
{
	int n=sz(x);
	int m=sz(x[0]);
	vector<vi> answer;
	for(int i=0;i<n;i++) 
	{
		vi row(m);
		answer.push_back(row);
	}
	allocate_tickets(answer);
	vi v;
	for (int i=0;i<n;i++) v.pb(x[i][0]);
	ll 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;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10