제출 #414985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414985		keko37	카니발 티켓 (IOI20_tickets)	C++14	16 / 100	794 ms	112996 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 1505;

int n, m, k;
int bio[MAXN][MAXN];
vector <pi> a[MAXN];
vector < pair <llint, pi> > v;

llint find_maximum (int K, vector < vector <int> > A) {
	k = K;
	n = A.size();
	m = A[0].size();
	memset(bio, -1, sizeof bio);
	llint res = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			a[i].push_back({A[i][j], j});
		}
		sort(a[i].begin(), a[i].end());
		for (int j = 0; j < k; j++) {
			bio[i][m - 1 - j] = 1;
			res += a[i][m - 1 - j].first;
			llint val = a[i][j].first + a[i][m - (k - j)].first;
			v.push_back({val, {i, j}});
		}
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < n * k / 2; i++) {
		llint val = v[i].first;
		int row = v[i].second.first, col = v[i].second.second;

		res -= val;
		bio[row][col] = 0;
		bio[row][m - (k - col)] = -1;
	}

	vector < vector <int> > sol;
	vector <int> tmp(m, 0);
	for (int i = 0; i < n; i++) sol.push_back(tmp);

	int curr = 0;
	for (int i = 0; i < n; i++) {
		int nula = 0, jen = 0;
		for (int j = 0; j < m; j++) {
			if (bio[i][j] == 0) nula++;
			if (bio[i][j] == 1) jen++;
			if (bio[i][j] != -1) {
				sol[i][a[i][j].second] = curr % k;
				curr++;
			} else {
				sol[i][a[i][j].second] = -1;
			}
		}
		curr += nula;
	}
	allocate_tickets(sol);
	return res;
}

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