제출 #1033077

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

tickets

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "tickets.h"
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer;
	ll ac=0;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
			ac+=x[i][j];
		}
		answer.push_back(row);
	}
	ac/=n;
	ll bs=1e17;
	for(int j=ac-2; j<ac+2; j++)
	{
        ll t1=0;
		for(int i=0; i<n; i++)
		{
			t1+=abs(x[i][0]-j);
		}
		bs=min(bs,t1);
	}
	allocate_tickets(answer);
	return bs;
}

• 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