제출 #794602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794602		MODDI	카니발 티켓 (IOI20_tickets)	C++14	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;
ll find_maximum(int k, vector<vi> x) {
	int n = x.size();
	int m = x[0].size();
	ll ans = 0, sum = 0;
	for(int i = 0; i < n; i++){
		sum += x[i][0];
	}
	//cout<<sum*1.0/n<<endl;
	ll choose = round(sum*1.0/n);
	for(int i = 0; i < n; i++){
		ans += abs(x[i][0] - choose);
	}
	vector<vi> ticket(n, vi(m, -1));
	for(int i = 0; i < n; i++){
		ticket[i][0] = 0;
	}
	allocate_tickets(ticket);
	return ans;
}

• 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