제출 #832328

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

tickets

#include "tickets.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

long long find_maximum(int k, std::vector<std::vector<int>> x)
{
	int N = x.size();
	int M = x[0].size();

	ll value = 0;
	vvi ans(N, vi(M, -1));
	vpii choose;

	for (int i = 0; i < N; ++i)
	{
		int mini = min_element(all(x[i])) - x[i].begin();
		ans[i][mini] = 0;
		mini = x[i][mini];
		int maxi = *max_element(all(x[i]));
		value -= mini;
		choose.push_back({mini + maxi, i});
	}
	sort(all(choose));
	for (int j = sz(choose) - 1; j >= sz(choose) / 2; --j)
	{
		int i = choose[j].second;
		value += choose[j].first;
		ans[i][min_element(all(x[i])) - x[i].begin()] = -1;
		ans[i][max_element(all(x[i])) - x[i].begin()] = 0;
	}

	allocate_tickets(ans);

	return value;
}

• 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