제출 #961714

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

tickets

#include "tickets.h"
#include <vector>
#include<iostream>
#include<algorithm>
#include<iomanip>

using namespace std;

#define ll long long
#define vi vector<int>
#define vvi vector<vi>

ll oink(vvi x) {
	//cerr << endl;
	allocate_tickets(x);
	int n = x.size();
	ll t = 0;
	vi L (n);
	for (int i = 0; i < n; i++) L[i] = x[i][0];
	sort(L.begin(), L.end());
	int a = L[n/2];
	//cerr << a << endl;
	for (auto i : L) t += abs(a-i);
	//cerr << endl;
	return t;
}

long long find_maximum(int k, vvi x) {
	int n = x.size();
	int m = x[0].size();
	if (m == 1) return oink(x);
	vvi answer;
	for (int i = 0; i < n; i++) {
		vi row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	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