oj.uz

Submission #451979

# Submission time Handle Problem Language Result Execution time Memory
451979 2021-08-03T15:12:05 Z rainboy Carnival Tickets (IOI20_tickets) C++17
41 / 100
 1130 ms 93660 KB 
#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; j++)
				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)
					hh[i_][rr[i_]--] = k;
				else
					hh[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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 26 ms 2336 KB Output is correct
6 Correct 615 ms 51292 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 42 ms 3976 KB Output is correct
6 Correct 8 ms 844 KB Output is correct
7 Correct 9 ms 1100 KB Output is correct
8 Correct 1130 ms 93660 KB Output is correct
9 Correct 997 ms 87400 KB Output is correct
10 Correct 984 ms 87436 KB Output is correct
11 Correct 1071 ms 93568 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Incorrect 2 ms 428 KB There is no ticket of color 0 on day 1
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Incorrect 2 ms 428 KB There is no ticket of color 0 on day 1
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 26 ms 2336 KB Output is correct
12 Correct 615 ms 51292 KB Output is correct
13 Incorrect 0 ms 204 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -