Submission #1169824

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169824		sleepntsheep	Koala Game (APIO17_koala)	C++20	0 / 100	0 ms	392 KiB

koala

#include "koala.h"

int minValue(int N, int W) {
	int R[222], B[222];
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j)
			B[j] = j == i;
		playRound(B, R);
		if (R[i] == 2)
			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.
    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: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53