제출 #577302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
577302		Vanilla	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	256 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	long long n = x.size();
	long long m = x[0].size();
	vector<vector<int>> answer (n, vector <int> (m));
	long long sum = 0;
	for (int i = 0; i < n; i++){
		sum+=x[i][0];
	}
	long long rs1 = 0, rs2 = 0, rs3 = 0;
	for (int i = 0; i < n; i++){
		rs1+=abs(1LL * x[i][0] - (sum / n));
		rs2+=abs(1LL * x[i][0] - ((sum / n) + 1));
		rs2+=abs(1LL * x[i][0] - ((sum / n) - 1));
	}
	
	allocate_tickets(answer);
	return max({rs1, rs2, rs3});
}

• 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