Submission #391598

#	Time	Username	Problem	Language	Result	Execution time	Memory
391598		BorisBarca	Koala Game (APIO17_koala)	C++14	0 / 100	1 ms	200 KiB

koala

#include <stdio.h>
#include <stdlib.h>
#include <koala.h>

#include <bits/stdc++.h>

using namespace std;

int R[105];
int B[105];

void playRound(int *B, int *R);

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