제출 #301381

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301381		Khongor	카니발 티켓 (IOI20_tickets)	C++14	25 / 100	1492 ms	108836 KiB

tickets

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

vector<vector<int>> ans;

// 1 5
// 10 10
// 8 12
// 12 20

const int MAX = 1555;
long long dp[MAX][MAX];

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

	long long res = 0;
	vector<pair<int, pair<int, int>>> all;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			all.push_back({x[i][j], {i, j}});
	sort(all.begin(), all.end());
	vector<vector<pair<int, int>>> high(n), pickedLow(n), pickedHigh(n);
	int median = (all[n * m / 2].first + all[n * m / 2 - 1].first) / 2;

	int cnt = 0;
	for (int i = 0; i < all.size(); i++) {
		int color = all[i].second.first;
		int ticket = all[i].second.second;
		if (i < all.size() / 2) {
			if (pickedLow[color].size() < k)  {
				pickedLow[color].push_back({median - all[i].first, ticket});
				cnt++;
				res += median - all[i].first;
			}
		} else {
			high[color].push_back({all[i].first - median, ticket});
		}
	}
	for (int i = 0; i < n; i++) {
		while (pickedLow[i].size() + pickedHigh[i].size() < k) {
			res += high[i].back().first;
			pickedHigh[i].push_back(high[i].back());
			high[i].pop_back();
		}
	}

	vector<vector<long long>> b(n);
	int need = cnt - n * k / 2;
	for (int i = 0; i < n; i++) {
		long long s = 0;
		b[i].push_back(0);
		for (int j = 1; j <= min(pickedLow[i].size(), high[i].size()); j++) {
			s += high[i][high[i].size() - j].first - pickedLow[i][pickedLow[i].size() - j].first;
			b[i].push_back(s);
		}
	}

	long long inf = -(1LL << 62);
	vector<vector<long long>> dp(n + 1, vector<long long>(need + 1, inf));
	dp[0][0] = 0;
	vector<vector<int>> back(n + 1, vector<int>(need + 1));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j <= need; j++) {
			if (dp[i][j] == inf) continue;
			for (int k = 0; k < b[i].size(); k++)
				if (dp[i][j] + b[i][k] > dp[i + 1][k + j]) {
					dp[i + 1][k + j] = dp[i][j] + b[i][k];
					back[i + 1][k + j] = k;
				}
		}
	}
	res += dp[n][need];

	for (int i = n - 1; i >= 0; i--) {
		int k = back[i + 1][need];
		need -= k;
		for (int j = 0; j < k; j++) {
			pickedLow[i].pop_back();
			pickedHigh[i].push_back(high[i].back());
			high[i].pop_back();
		}
	}

	// vector<int> at(n, 0);
	// while (need--) {
	// 	int idx = -1, best = 0;
	// 	for (int i = 0; i < n; i++) {
	// 		if (at[i] == b[i].size()) continue;
	// 		int cur;
	// 		cur = b[i][at[i]];

	// 		if (idx == -1 || cur > best) {
	// 			best = cur;
	// 			idx = i;
	// 		}
	// 	}

	// 	assert(idx != -1);

	// 	// switch
	// 	res += best;
	// 	at[idx]++;
	// 	pickedLow[idx].pop_back();
	// 	pickedHigh[idx].push_back(high[idx].back());
	// 	high[idx].pop_back();
	// }


	// construct
	for (int r = 0; r < k; r++) {
		vector<bool> used(n);
		vector<pair<int, int>> counts;
		for (int i = 0; i < n; i++) counts.push_back({pickedLow[i].size(), i});
		sort(counts.rbegin(), counts.rend());

		int taken = 0;
		for (int ii = 0; ii < n; ii++) {
			int i = counts[ii].second;
			if (pickedLow[i].size() > 0) {
				used[i] = true;
				taken++;
				ans[i][pickedLow[i].back().second] = r;
				pickedLow[i].pop_back();
			}
			if (taken == n / 2) break;
		}
		taken = 0;
		for (int i = 0; i < n; i++) {
			if (pickedHigh[i].size() > 0 && !used[i]) {
				taken++;
				ans[i][pickedHigh[i].back().second] = r;
				pickedHigh[i].pop_back();
			}
			if (taken == n / 2) break;
		}
	}

	allocate_tickets(ans);
	return res;
}

// a b a c
// c b d d

컴파일 시 표준 에러 (stderr) 메시지

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = 0; i < all.size(); i++) {
      |                  ~~^~~~~~~~~~~~
tickets.cpp:33:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   if (i < all.size() / 2) {
      |       ~~^~~~~~~~~~~~~~~~
tickets.cpp:34:32: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |    if (pickedLow[color].size() < k)  {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~^~~
tickets.cpp:44:53: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |   while (pickedLow[i].size() + pickedHigh[i].size() < k) {
      |          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
tickets.cpp:56:21: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   56 |   for (int j = 1; j <= min(pickedLow[i].size(), high[i].size()); j++) {
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tickets.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    for (int k = 0; k < b[i].size(); k++)
      |                    ~~^~~~~~~~~~~~~

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