Submission #736508

#TimeUsernameProblemLanguageResultExecution timeMemory
736508vjudge1Koala Game (APIO17_koala)C++11
4 / 100
4 ms300 KiB
#include "koala.h"

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.
        int A[N], B[N];
        for (int i = 0; i < N; i++) A[i] = i == 0;
        playRound(A, B);
        for (int i = 0; i < N; i++) {
                if (B[i] <= A[i]) return i;
        }
}

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

Compilation message (stderr)

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
   13 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...