제출 #436065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436065		prvocislo	카니발 티켓 (IOI20_tickets)	C++17	49 / 100	3072 ms	56012 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int maxn = 2005;
vector<int> cntm(maxn, 0);
bool cmp(const int &i, const int &j) { return cntm[i] < cntm[j]; }
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll ans = 0;
	vector<int> l(n, -1), r(n, m); // kolko minusov mame v tomto riadku
	priority_queue<pair<ll, int> > p1; // vymenime nejake velke cislo za male cislo
	for (int i = 0; i < n/2; i++) // zoberieme len maxima
	{
		r[i] = m - k;
		for (int j = 0; j < k; j++)
			ans += x[i][r[i] + j];
		p1.push({-x[i][l[i]+1] - x[i][r[i]], i});
	}
	priority_queue<pair<ll, int> > p2;
	for (int i = n/2; i < n; i++) // zoberieme len minima
	{
		l[i] = k-1;
		for (int j = 0; j <= l[i]; j++)
			ans -= x[i][j];
		p2.push({x[i][l[i]] + x[i][r[i]-1], i});
	}
	while (p1.top().first + p2.top().first > 0) // vieme to urobit aj lepsie
	{
		ans += p1.top().first + p2.top().first;
		int i1 = p1.top().second, i2 = p2.top().second;
		l[i1]++, r[i1]++, l[i2]--, r[i2]--;
		p1.pop(), p2.pop();
		if (r[i1] < m) p1.push({-x[i1][l[i1]+1] - x[i1][r[i1]], i1});
		if (l[i2] >= 0) p2.push({x[i2][l[i2]] + x[i2][r[i2]-1], i2});
	}
	vector<int> v(k);
	vector<vector<int> > s(n, vector<int>(m, -1));
	for (int i = 0; i < k; i++) v[i] = i;
	for (int i = 0; i < n; i++)
	{
		int cnt = 0;
		nth_element(v.begin(), v.begin() + l[i] + 1, v.end(), cmp);
		for (int j = 0; j <= l[i]; j++)
			cntm[v[j]]++, s[i][j] = v[cnt++];
		for (int j = r[i]; j < m; j++)
			s[i][j] = v[cnt++];
	}
	allocate_tickets(s);
	return ans;
}

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