Submission #1169855

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169855		sleepntsheep	Koala Game (APIO17_koala)	C++20	4 / 100	4 ms	420 KiB

koala

#include "koala.h"

int minValue(int N, int W) {
	int R[222], B[222], R2[222];
	for (int i = 0; i < N; ++i)
		B[i] = 1;
	playRound(B, R);
	int id = -1;
	for (int i = 0; i < N; ++i)
		B[i] = 0;
	for (int i = 0; i < N; ++i) {
		if (! R[i]) {
			if (~id) {
			} else {
				id = i;
				B[i] = 1;
			}
		}
	}

	playRound(B, R2);

	if (! R2[id])
		return id;

	for (int i = 0; i < N; ++i) 
		if (! R[i] && ! R2[i])
			return i;

	return 0;
}

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.
	return 0;
}

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.
	return 0;
}

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.
	} else {
		// TODO: Implement Subtask 5 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53