oj.uz

Submission #380319

# Submission time Handle Problem Language Result Execution time Memory
380319 2021-03-21T02:03:00 Z rainboy Koala Game (APIO17_koala) C
82 / 100
 50 ms 512 KB 
#include "koala.h"
#include <stdio.h>
#include <string.h>

#define N	100

int minValue(int n, int w) {
	static int bb[N], rr[N];
	int i;

	memset(bb, 0, n * sizeof *bb), bb[0] = 1;
	playRound(bb, rr);
	for (i = 1; i < n; i++)
		if (rr[i] == 0)
			return i;
	return 0;
}

int aa[] = { 2, 4, 11 };

char used[N];

int maxValue(int n, int w) {
	static int bb[N], rr[N];
	int i, r;

	for (i = 0; i < N; i++)
		bb[i] = 1;
	playRound(bb, rr);
	for (r = 0; r < 3; r++) {
		for (i = 0; i < N; i++)
			if (bb[i] && rr[i] > bb[i])
				bb[i] = aa[r];
			else
				bb[i] = 0;
		playRound(bb, rr);
	}
	for (i = 0; i < N; i++)
		if (bb[i] && rr[i] > bb[i])
			return i;
	return -1;
}

int greaterValue(int n, int w) {
	/*
	static int bb[N], rr[N];
	int i_ = maxValue(n, w), i;

	if (i_ < 2)
		return i_;
	for (i = 0; i < n; i++)
		bb[i] = 1;
	bb[i_] = bb[0] = bb[1] = 0;
	playRound(bb, rr);
	return rr[0] > bb[0];
	*/
	return n + w;
}

int n_;

int compare(int i, int j) {
	static int bb[N], rr[N];

	memset(bb, 0, n_ * sizeof *bb);
	bb[i] = bb[j] = n_;
	playRound(bb, rr);
	return rr[i] > bb[i] ? 1 : -1;
}

void sort(int *ii, int l, int r) {
	static int jj[N];
	int m, i, j, k;

	if (r - l == 1)
		return;
	m = (l + r) / 2;
	sort(ii, l, m), sort(ii, m, r);
	i = l, j = m, k = l;
	while (i < m && j < r)
		jj[k++] = compare(ii[i], ii[j]) < 0 ? ii[i++] : ii[j++];
	while (i < m)
		jj[k++] = ii[i++];
	while (j < r)
		jj[k++] = ii[j++];
	memcpy(ii + l, jj + l, (r - l) * sizeof *jj);
}

int lrb[][3] = {
	{ 0, 100, 1 }, { 0, 50, 1 }, { 0, 50, 2 }, { 50, 100, 1 }, { 50, 100, 2 },
	{ 0, 25, 1 }, { 0, 25, 2 }, { 0, 25, 3 }, { 0, 25, 4 }, { 25, 34, 2 },
	{ 25, 34, 3 }, { 25, 34, 4 }, { 25, 34, 5 }, { 25, 34, 8 }, { 34, 50, 2 },
	{ 34, 50, 3 }, { 34, 50, 4 }, { 34, 50, 5 }, { 34, 50, 6 }, { 50, 60, 2 },
	{ 50, 60, 3 }, { 50, 60, 4 }, { 50, 60, 5 }, { 50, 60, 7 }, { 50, 60, 10 },
	{ 60, 75, 2 }, { 60, 75, 3 }, { 60, 75, 4 }, { 60, 75, 5 }, { 75, 100, 2 },
	{ 75, 100, 3 }, { 75, 100, 4 }, { 0, 13, 1 }, { 0, 13, 2 }, { 0, 13, 3 },
	{ 0, 13, 4 }, { 0, 13, 6 }, { 13, 17, 2 }, { 13, 17, 3 }, { 13, 17, 4 },
	{ 17, 19, 3 }, { 20, 25, 2 }, { 20, 25, 3 }, { 20, 25, 4 }, { 20, 25, 5 },
	{ 25, 28, 3 }, { 25, 28, 5 }, { 28, 30, 4 }, { 34, 40, 3 }, { 34, 40, 4 },
	{ 34, 40, 5 }, { 34, 40, 7 }, { 40, 43, 4 }, { 40, 43, 6 }, { 43, 45, 5 },
	{ 47, 50, 4 }, { 47, 50, 6 }, { 51, 54, 5 }, { 51, 54, 6 }, { 54, 56, 6 },
	{ 60, 63, 5 }, { 60, 63, 7 }, { 63, 67, 4 }, { 63, 67, 5 }, { 63, 67, 7 },
	{ 67, 69, 7 }, { 69, 71, 7 }, { 71, 75, 5 }, { 71, 75, 6 }, { 71, 75, 8 },
	{ 75, 83, 3 }, { 75, 83, 4 }, { 75, 83, 5 }, { 75, 83, 7 }, { 75, 83, 10 },
	{ 83, 88, 4 }, { 83, 88, 5 }, { 83, 88, 6 }, { 83, 88, 9 }, { 88, 91, 6 },
	{ 88, 91, 8 }, { 91, 100, 3 }, { 91, 100, 4 }, { 91, 100, 5 }, { 91, 100, 6 },
	{ 91, 100, 8 }, { 91, 100, 11 }, { 0, 7, 1 }, { 0, 7, 2 }, { 0, 7, 3 },
	{ 7, 9, 2 }, { 34, 36, 5 }, { 76, 78, 7 }, { 78, 80, 7 }, { 92, 95, 6 },
	{ 92, 95, 8 }, { 0, 4, 1 }, { 0, 4, 2 }, { 0, 2, 1 }, 
}; /* done by hand */

void allValues(int n, int w, int *pp) {
	static int ii[N];
	int i;

	for (i = 0; i < n; i++)
		ii[i] = i;
	if (w == n * 2)	/* mergesort */
		n_ = n, sort(ii, 0, n);
	else {	/* quicksort */
		static int bb[N], rr[N];
		int h;

		for (h = 0; h < 99; h++) {
			int l = lrb[h][0], r = lrb[h][1], b = lrb[h][2], tmp;

			memset(bb, 0, n * sizeof *bb);
			for (i = l; i < r; i++)
				bb[ii[i]] = b;
			playRound(bb, rr);
			while (l < r)
				if (rr[ii[l]] <= bb[ii[l]])
					l++;
				else {
					r--;
					tmp = ii[l], ii[l] = ii[r], ii[r] = tmp;
				}
		}
	}
	for (i = 0; i < n; i++)
		pp[ii[i]] = i + 1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 364 KB Output is correct
2 Correct 5 ms 364 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 492 KB Output is correct
2 Correct 18 ms 364 KB Output is correct
3 Correct 18 ms 364 KB Output is correct
4 Correct 18 ms 364 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 364 KB Output is correct
2 Correct 45 ms 492 KB Output is correct
3 Correct 46 ms 364 KB Output is correct
4 Correct 50 ms 492 KB Output is correct
5 Correct 44 ms 364 KB Output is correct
6 Correct 44 ms 364 KB Output is correct
7 Correct 43 ms 364 KB Output is correct
8 Correct 43 ms 364 KB Output is correct
9 Correct 43 ms 364 KB Output is correct
10 Correct 43 ms 512 KB Output is correct
11 Correct 44 ms 492 KB Output is correct
12 Correct 29 ms 364 KB Output is correct
13 Correct 44 ms 364 KB Output is correct
14 Correct 40 ms 364 KB Output is correct
15 Correct 40 ms 364 KB Output is correct
16 Correct 39 ms 364 KB Output is correct
17 Correct 39 ms 384 KB Output is correct
18 Correct 40 ms 492 KB Output is correct
19 Correct 40 ms 364 KB Output is correct
20 Correct 39 ms 492 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 364 KB Output is correct
2 Correct 5 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 5 ms 364 KB Output is correct
6 Correct 5 ms 364 KB Output is correct
7 Correct 4 ms 364 KB Output is correct
8 Correct 4 ms 364 KB Output is correct
9 Correct 5 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 4 ms 364 KB Output is correct
13 Correct 5 ms 364 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 5 ms 364 KB Output is correct
18 Correct 4 ms 364 KB Output is correct
19 Correct 4 ms 364 KB Output is correct
20 Correct 4 ms 364 KB Output is correct
21 Correct 5 ms 364 KB Output is correct
22 Correct 5 ms 364 KB Output is correct
23 Correct 4 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Correct 4 ms 364 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 4 ms 364 KB Output is correct
28 Correct 5 ms 364 KB Output is correct
29 Correct 4 ms 364 KB Output is correct
30 Correct 5 ms 492 KB Output is correct
31 Correct 4 ms 364 KB Output is correct
32 Correct 4 ms 364 KB Output is correct
33 Correct 4 ms 364 KB Output is correct
34 Correct 4 ms 364 KB Output is correct
35 Correct 4 ms 364 KB Output is correct
36 Correct 4 ms 364 KB Output is correct
37 Correct 5 ms 364 KB Output is correct
38 Correct 4 ms 364 KB Output is correct
39 Correct 5 ms 364 KB Output is correct
40 Correct 5 ms 364 KB Output is correct