oj.uz

Submission #732706

# Submission time Handle Problem Language Result Execution time Memory
732706 2023-04-29T07:43:12 Z SanguineChameleon Koala Game (APIO17_koala) C++17
47 / 100
 78 ms 332 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];

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 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.
	}
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 328 KB Output is correct
2 Correct 71 ms 328 KB Output is correct
3 Correct 73 ms 332 KB Output is correct
4 Correct 78 ms 324 KB Output is correct
5 Correct 71 ms 332 KB Output is correct
6 Correct 76 ms 324 KB Output is correct
7 Correct 72 ms 324 KB Output is correct
8 Correct 77 ms 328 KB Output is correct
9 Correct 77 ms 328 KB Output is correct
10 Correct 75 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 208 KB Output is correct
2 Correct 33 ms 208 KB Output is correct
3 Correct 32 ms 296 KB Output is correct
4 Correct 33 ms 208 KB Output is correct
5 Correct 32 ms 208 KB Output is correct
6 Correct 33 ms 292 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Correct 30 ms 296 KB Output is correct
9 Correct 30 ms 208 KB Output is correct
10 Correct 31 ms 208 KB Output is correct
11 Correct 32 ms 312 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 29 ms 208 KB Output is correct
14 Correct 27 ms 208 KB Output is correct
15 Correct 29 ms 296 KB Output is correct
16 Correct 29 ms 208 KB Output is correct
17 Correct 27 ms 316 KB Output is correct
18 Correct 28 ms 208 KB Output is correct
19 Correct 27 ms 208 KB Output is correct
20 Correct 29 ms 208 KB Output is correct

Subtask #5
0 / 53.0

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