oj.uz

Submission #732721

# Submission time Handle Problem Language Result Execution time Memory
732721 2023-04-29T08:10:35 Z SanguineChameleon Koala Game (APIO17_koala) C++17
100 / 100
 89 ms 472 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int B[120];
int R[120];

int minValue(int N, int W) {
	// TODO: Implement Subtask 1 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	B[0] = 1;
	for (int i = 1; i < N; i++) {
		B[i] = 0;
	}
	playRound(B, R);
	for (int i = 0; i < N; i++) {
		if (R[i] <= B[i]) {
			return i;
		}
	}
	return -1;
}

int maxValue(int N, int W) {
	// TODO: Implement Subtask 2 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	int cnt = N;
	for (int i = 0; i < N; i++) {
		B[i] = 1;
	}
	while (cnt > 1) {
		for (int i = 0; i < N; i++) {
			if (B[i] == 1) {
				B[i] = W / cnt;
			}
		}
		playRound(B, R);
		cnt = 0;
		for (int i = 0; i < N; i++) {
			B[i] = (B[i] > 0 && R[i] > B[i]);
			cnt += B[i];
		}
	}
	for (int i = 0; i < N; i++) {
		if (B[i] == 1) {
			return i;
		}
	}
	return -1;
}

int greaterValue(int N, int W) {
	// TODO: Implement Subtask 3 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	vector<int> vals = {2, 4, 8};
	for (auto x: vals) {
		B[0] = x;
		B[1] = x;
		for (int i = 2; i < N; i++) {
			B[i] = 0;
		}
		playRound(B, R);
		if ((R[0] > B[0]) != (R[1] > B[1])) {
			if (R[0] > B[0]) {
				return 0;
			}
			else {
				return 1;
			}
		}
		else {
			if (x == 2 && R[0] <= B[0]) {
				return minValue(N, W) ^ 1;
			}
		}
	}
	return -1;
}

int order[120];
int split[120][120];
int res[120];

bool cmp(int x, int y) {
	for (int i = 0; i < 100; i++) {
		B[i] = 0;
	}
	B[x] = 100;
	B[y] = 100;
	playRound(B, R);
	return R[x] < R[y];
}

void solve(vector<int> cand, int lt, int rt) {
	if (lt == rt) {
		res[cand[0]] = lt;
		return;
	}
	int k = split[lt][rt];
	for (int i = 0; i < 100; i++) {
		B[i] = 0;
	}
	for (auto id: cand) {
		B[id] = k;
	}
	playRound(B, R);
	vector<int> left_cand;
	vector<int> right_cand;
	for (auto id: cand) {
		if (R[id] > B[id]) {
			right_cand.emplace_back(id);
		}
		else {
			left_cand.emplace_back(id);
		}
	}
	int sz = left_cand.size();
	solve(left_cand, lt, lt + sz - 1);
	solve(right_cand, lt + sz, rt);
}

int sum(int lt, int rt) {
	return (lt + rt) * (rt - lt + 1) / 2;
}

int suf(int rt, int len) {
	return sum(rt - len + 1, rt);
}

void allValues(int N, int W, int *P) {
	if (W == 2 * N) {
		// TODO: Implement Subtask 4 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
		for (int i = 0; i < N; i++) {
			order[i] = i;
		}
		stable_sort(order, order + N, cmp);
		for (int i = 0; i < N; i++) {
			P[order[i]] = i + 1;
		}
	}
	else {
		// TODO: Implement Subtask 5 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
		for (int len = 1; len <= 100; len++) {
			for (int i = 1; i + len <= 101; i++) {
				int j = i + len - 1;
				split[i][j] = -1;
				for (int k = 1; k <= 100 / len; k++) {
					int mx = -1;
					bool ok = true;
					for (int x = 0; x <= len && x * (k + 1) <= 100; x++) {
						int rem = min(100 - len, 100 - x * (k + 1));
						int cur = suf(j, x) + (rem <= 100 - j ? suf(100, rem) : sum(j + 1, 100) + suf(i - 1, rem - (100 - j)));
						if (cur > mx) {
							mx = cur;
							ok = true;
						}
						if (cur == mx) {
							ok &= (x > 0 && x < len && split[i][j - len] != -1 && split[j - len + 1][j]);
						}
					}
					if (ok) {
						split[i][j] = k;
						break;
					}
				}
			}
		}
		vector<int> cand(N);
		for (int i = 0; i < N; i++) {
			cand[i] = i;
		}
		solve(cand, 1, N);
		for (int i = 0; i < N; i++) {
			P[i] = res[i];
		}
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 4 ms 320 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 208 KB Output is correct
2 Correct 11 ms 208 KB Output is correct
3 Correct 12 ms 324 KB Output is correct
4 Correct 12 ms 324 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 328 KB Output is correct
2 Correct 89 ms 328 KB Output is correct
3 Correct 77 ms 324 KB Output is correct
4 Correct 74 ms 348 KB Output is correct
5 Correct 71 ms 320 KB Output is correct
6 Correct 80 ms 336 KB Output is correct
7 Correct 79 ms 336 KB Output is correct
8 Correct 78 ms 336 KB Output is correct
9 Correct 76 ms 328 KB Output is correct
10 Correct 72 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 324 KB Output is correct
2 Correct 33 ms 208 KB Output is correct
3 Correct 38 ms 212 KB Output is correct
4 Correct 30 ms 320 KB Output is correct
5 Correct 31 ms 316 KB Output is correct
6 Correct 30 ms 208 KB Output is correct
7 Correct 30 ms 296 KB Output is correct
8 Correct 33 ms 300 KB Output is correct
9 Correct 32 ms 308 KB Output is correct
10 Correct 28 ms 316 KB Output is correct
11 Correct 31 ms 320 KB Output is correct
12 Correct 13 ms 320 KB Output is correct
13 Correct 38 ms 208 KB Output is correct
14 Correct 27 ms 208 KB Output is correct
15 Correct 26 ms 316 KB Output is correct
16 Correct 31 ms 208 KB Output is correct
17 Correct 31 ms 316 KB Output is correct
18 Correct 27 ms 208 KB Output is correct
19 Correct 28 ms 304 KB Output is correct
20 Correct 32 ms 316 KB Output is correct

Subtask #5
53.0 / 53.0

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