제출 #451977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
451977		rainboy	카니발 티켓 (IOI20_tickets)	C++17	16 / 100	612 ms	51400 KiB

tickets

#include "tickets.h"

using namespace std;

typedef vector<int> vi;

const int N = 1500, M = 1500;

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int aa_[N * M], ii[N * M];

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (aa_[ii[j]] == aa_[i_])
				j++;
			else if (aa_[ii[j]] < aa_[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int ll[N], rr[N], kk[N];

long long find_maximum(int k, std::vector<std::vector<int>> aa) {
	int n = aa.size(), m = aa[0].size();
	vector<vi> hh(n);
	int i, j;
	long long ans;

	for (i = 0; i < n; i++) {
		hh[i].resize(m);
		for (j = 0; j < m; j++)
			hh[i][j] = -1;
	}
	if (k == m) {
		for (i = 0; i < n; i++)
			for (j = 0; j < m; j++)
				aa_[i * m + j] = aa[i][j];
		for (i = 0; i < n * m; i++)
			ii[i] = i;
		sort(ii, 0, n * m);
		ans = 0;
		for (i = 0; i < n * m; i++) {
			ans += i < n * m / 2 ? -aa_[ii[i]] : aa_[ii[i]];
			hh[ii[i] / m][ii[i] % m] = i < n * m / 2 ? 0 : 1;
		}
		for (i = 0; i < n; i++) {
			ll[i] = 0, rr[i] = m - 1;
			for (j = 0; j < m; i++)
				if (hh[i][j] == 0)
					kk[i]++;
		}
		while (k--) {
			for (i = 0; i < n; i++) {
				aa_[i] = kk[i];
				ii[i] = i;
			}
			sort(ii, 0, n);
			for (i = 0; i < n; i++) {
				int i_ = ii[i];

				if (i < n / 2)
					aa[i_][rr[i_]--] = k;
				else
					aa[i_][ll[i_]++] = k, kk[i_]--;
			}
		}
	} else {
		ans = 0;
		for (i = 0; i < n; i++) {
			ans -= aa[i][0];
			aa_[i] = aa[i][m - 1] + aa[i][0];
			hh[i][0] = 0;
			ii[i] = i;
		}
		sort(ii, 0, n);
		for (i = n / 2; i < n; i++) {
			int i_ = ii[i];

			hh[i_][0] = -1, hh[i_][m - 1] = 0;
			ans += aa_[i_];
		}
	}
	allocate_tickets(hh);
	return ans;
}

• 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