oj.uz

Submission #57331

# Submission time Handle Problem Language Result Execution time Memory
57331 2018-07-14T14:51:14 Z fredbr Koala Game (APIO17_koala) C++17
4 / 100
 12 ms 576 KB 
#include "koala.h"
#include <bits/stdc++.h>

const int maxn = 110;

int d[maxn], res[maxn];

int minValue(int N, int W) {

    d[0] = 1;
    playRound(d, res);
    if (res[0] == 0)
        return 0;
    for (int i = 1; i < N; i++)
        if (res[i] == 0)
            return i;
    return 0;
}

int maxValue(int N, int W) {
    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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 248 KB Output is correct
2 Correct 8 ms 356 KB Output is correct
3 Correct 8 ms 448 KB Output is correct
4 Correct 7 ms 512 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 576 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 576 KB Output isn't correct
2 Halted 0 ms 0 KB -