Submission #406839

# Submission time Handle Problem Language Result Execution time Memory
406839 2021-05-18T05:58:34 Z benedict0724 Koala Game (APIO17_koala) C++17
4 / 100
7 ms 292 KB
#include "koala.h"

int B[100], R[100];

void initialize(int N)
{
    for(int i=0;i<N;i++)
    {
        B[i] = 0;
        R[i] = 0;
    }
    return;
}
int minValue(int N, int W) {
    initialize(N);
    B[0] = 1;
    playRound(B, R);
    int ans = 0;
    for(int i=1;i<N;i++)
    {
        if(R[i] == 0) ans = i;
    }
    return ans;
}

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.
    }
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 7 ms 292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Output isn't correct
2 Halted 0 ms 0 KB -