제출 #793512

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

tickets

#include "tickets.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<int> vl;
long long find_maximum(int k, vector<vi> x) {
	int n = x.size();
	int m = x[0].size();
	if(m == 1){
		ll sum = 0;
		for(int i = 0; i < n; i++)	sum += x[i][0];
		vector<vi> al(n);
		for(int i = 0; i < n; i++)
			al[i].pb(1);
			
		allocate_tickets(al);
		ll choose = sum / n, choose1 = (sum + n - 1) / n;
		ll ans1 = 0, ans2 = 0;
		for(int i = 0; i < n; i++){
			ans1 += abs(x[i][0] - choose);
			ans2 += abs(x[i][0] - choose1);
		}
		return max(ans1, ans2);
	}
	return 1;
}

• 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