제출 #302919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302919		FelixMP	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	1088 ms	54520 KiB

tickets

#include "tickets.h"
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll ansv = 0;


	vi curidx = vi(n, 0);

	set<ii> curmin;
	for(int i=0; i < n; ++i) {
		curmin.insert(ii(x[i][0] + x[i][m-k], i));
		for(int j=m-k; j < m; ++j) {
			ansv += x[i][j];
		}
	}

	for(int z=0; z < (n/2)*k; ++z) {
		ii p = *(curmin.begin());
		curmin.erase(curmin.begin());
		ansv -= p.first;
		int i = p.second;
		curidx[i]++;
		if(curidx[i]+m-k < m) {
			curmin.insert(ii(x[i][curidx[i]] + x[i][curidx[i]+m-k], i));
		}
	}

	vvi answer = vvi(n, vi(m, -1));
	vi cnt = vi(curidx);
	vi pi = vi(n, m-1);
	vi ni = vi(n, 0);
	for(int z=0; z < k; ++z) {
		vector<ii> sv (n);
		for(int i=0; i < n; ++i) sv[i] = ii(cnt[i], i);
		sort(sv.begin(), sv.end());
		for(int j=0; j < n; ++j) {
			int i = sv[j].second;
			if(j < n/2) {
				answer[i][pi[i]] = z;
				pi[i]--;
			}
			else {
				answer[i][ni[i]] = z;
				ni[i]++;
				cnt[i]--;
			}
		}
	}

	allocate_tickets(answer);


	return ansv;
}

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