Submission #301797

#	Time	Username	Problem	Language	Result	Execution time	Memory
301797		Muhammetali	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	384 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;
ll find_maximum(int k,vector<vi> x)
{
	int n=sz(x);
	int m=sz(x[0]);
	int mn=INT_MAX,mx=0;
	pi nind,xind;
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)if(mn>x[i][j]){mn=x[i][j];nind={i,j};}
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)if(mx<x[i][j] && nind.f!=i){mx=x[i][j];xind={i,j};}
	vi v;
	ll mid=mn+mx/2;
	for (int i=0;i<n;i++)
	{
		ll count=INT_MAX,ind;
		if (i==nind.f)
		{
			v.pb(x[i][nind.s]);
			for (int j=0;j<m;j++)
			{
				if (j==nind.s)x[i][j]=0;
				else x[i][j]=-1;
			}
		}
		else if (i==xind.f)
		{
			v.pb(x[i][xind.s]);
			for (int j=0;j<m;j++)
			{
				if (j==xind.s)x[i][j]=0;
				else x[i][j]=-1;
			}
		}
		else
		{
			for (int j=0;j<m;j++)
			{
				ll k=abs(mid-x[i][j]);
				if (count>k)
				{
					count=k;
					ind=j;
				}
			}
			for (int j=0;j<m;j++)
			{
				if (j==ind)x[i][j]=0;
				else x[i][j]=-1;
			}
			v.pb(x[i][ind]);
		}
	}
	sort(v.begin(),v.end());
	mid=n/2;
	ll res=0;
	for (int i=0;i<n;i++)res+=abs(v[i]-v[mid]);
	allocate_tickets(x);
	return res;
}

Compilation message (stderr)

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:65:5: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |     if (j==ind)x[i][j]=0;
      |     ^~

• 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