제출 #416571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
416571		SuhaibSawalha1	카니발 티켓 (IOI20_tickets)	C++17	41 / 100	694 ms	70724 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
long long calc (vector<long long> &a) {
	int n = a.size();
	long long sum = accumulate(a.begin(), a.end(), 0LL), m = LLONG_MAX, sum2 = 0;
	sort(a.begin(), a.end());
	for (int i = 0; i < n; ++i) {
		sum -= a[i];
		m = min(m, a[i] * i - sum2 + sum - a[i] * (n - i - 1));
		sum2 += a[i];
	}
	return m;
}
 
long long find_maximum(int k, vector<vector<int>> a) {
	long long ans = 0;
	int n = a.size();
	int m = a[0].size();
	vector<vector<int>> g(n, vector<int>(m, -1));
	if (m == 1) {
		vector<long long> ask;
		g.assign(n, vector<int>(m, 0));
		for (auto &e : a) {
			ask.push_back(e[0]);
		}
		allocate_tickets(g);
		return calc(ask);
	}
	if (k == 1) {
		vector<vector<array<int, 2>>> a2(n, vector<array<int, 2>>(m));
		long long mxs = 0;
		vector<long long> ask;
		vector<array<int, 2>> ms;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				a2[i][j] = {a[i][j], j};
			}
			sort(a2[i].begin(), a2[i].end());
			mxs += a2[i][m - 1][0];
			ms.push_back({-a2[i][0][0] - a2[i][m - 1][0], i});
		}
		sort(ms.rbegin(), ms.rend());
		for (int i = 0; i < n / 2; ++i) {
			ask.push_back(a2[ms[i][1]][0][0]);
			g[ms[i][1]][a2[ms[i][1]][0][1]] = 0;
		}
		for (int i = 0; i < n; ++i) {
			if (count(g[i].begin(), g[i].end(), -1) == m) {
				ask.push_back(a2[i][m - 1][0]);
				g[i][a2[i][m - 1][1]] = 0;
			}
		}
		allocate_tickets(g);
		return calc(ask);
	}
	vector<pair<int, array<vector<int>, 2>>> t;
	for (int i = 0; i < n; ++i) {
		array<vector<int>, 2> v;
		for (int j = 0; j < m; ++j) {
			v[a[i][j]].push_back(j);
		}
		t.push_back({i, v});
	} 
	#define zero(a) a.second[0].size()
	#define one(a) a.second[1].size()
	for (int kc = 0; kc < k; ++kc) {
		sort(t.begin(), t.end(), [&] (auto &a, auto &b) {
			return zero(a) > zero(b);
		});
		int zeros = 0, ones = 0;
		for (int i = 0; i < n / 2; ++i) {
			if (zero(t[i])) {
				++zeros;
				g[t[i].first][t[i].second[0].back()] = kc;
				t[i].second[0].pop_back();
			}
			else {
				++ones;
				g[t[i].first][t[i].second[1].back()] = kc;
				t[i].second[1].pop_back();
			}
		}
		for (int i = n / 2; i < n; ++i) {
			if (one(t[i])) {
				++ones;
				g[t[i].first][t[i].second[1].back()] = kc;
				t[i].second[1].pop_back();
			}
			else {
				++zeros;
				g[t[i].first][t[i].second[0].back()] = kc;
				t[i].second[0].pop_back();
			}
		}	
		ans += min(ones, zeros);
	}
	allocate_tickets(g);
	return ans;
}

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