제출 #424996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424996		Mlxa	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	731 ms	73116 KiB

tickets

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "tickets.h"
#include <vector>

ll find_maximum(int k, vector<vector<int>> x) {
	int n = (int)x.size();
	int m = (int)x[0].size();
	assert(k == 1);
	vector<vector<int>> answer(n, vector<int>(m, -1));
	vector<int> ord(n);
	iota(all(ord), 0);
	sort(all(ord), [&](int i, int j) {
		return x[i].front() + x[i].back() < x[j].front() + x[j].back();
	});
	ll sum = 0;
	for (int i = 0; i < n / 2; ++i) {
		sum -= x[ord[i]].front();
		answer[ord[i]].front() = 0;
	}
	for (int i = n / 2; i < n; ++i) {
		sum += x[ord[i]].back();
		answer[ord[i]].back() = 0;
	}
	allocate_tickets(answer);
	return sum;
}

#ifdef LC
#include "grader.cpp"
#endif

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10