제출 #497245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497245		Hanksburger	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	696 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > ans;
long long Y[1505];
vector<int> tmp;
long long find_maximum(int K, vector<vector<int> > X)
{
	long long N=X.size(), M=X[0].size(), ret=0;
	if (M==1)
	{
		for (long long i=0; i<N; i++)
			Y[i]=X[i][0];
		sort(Y, Y+N);
		for (long long i=0; i<N; i++)
			ret+=abs(Y[N/2]-Y[i]);
		for (long long i=0; i<N; i++)
		{
			tmp.clear();
			tmp.push_back(0);
			ans.push_back(tmp);
		}
	}
	allocate_tickets(ans);
	return ret;
}

• Subtask 1: 11 / 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