제출 #425025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425025		Mlxa	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	2 ms	684 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();
	vector<vector<int>> answer(n, vector<int>(m, -1));
	assert(k == 1);
	vector<int> cnt(n);
	for (int i = 0; i < n; ++i) {
		cnt[i] = accumulate(all(x[i]), 0);
	}
	vector<int> ord(n);
	iota(all(ord), 0);
	sort(all(ord), [&](int i, int j) {
		return cnt[i] < cnt[j];
	});
	for (int i = 0; i < n / 2; ++i) {
		for (int j = 0; j < k; ++j) {
			answer[ord[i]][j] = j;
		}
	}
	for (int i = n / 2; i < n; ++i) {
		for (int j = 0; j < k; ++j) {
			answer[ord[i]][m - 1 - j] = j;
		}
	}
	vector<vector<int>> res(k);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			// cout << answer[i][j] << " ";
			if (answer[i][j] != -1) {
				res[answer[i][j]].push_back(x[i][j]);
			}
		}
		// cout << endl;
	}
	ll sum = 0;
	for (int i = 0; i < k; ++i) {
		sort(all(res[i]));
		assert((int)res[i].size() == n);
		for (int j = 0; j < n / 2; ++j) {
			sum += res[i][n - 1 - j] - res[i][j];
		}
	}
	allocate_tickets(answer);
	return sum;
}

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

• Subtask 1: 11 / 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