oj.uz

답안 #57838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
57838 2018-07-16T09:54:56 Z thiago4532 코알라 (APIO17_koala) C++17
4 / 100
 10 ms 668 KB 
#include "koala.h"

int minValue(int N, int W) {
    int *R = new int[W];
    int *B = new int[W];
    for(int i=0;i<W;i++) B[i] = 0;
    B[0] = 1;
    playRound(B, R);

    for(int i=0;i<W;i++){
        if(!R[i]) return i;
    }
    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
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 8 ms 484 KB Output is correct
3 Correct 7 ms 576 KB Output is correct
4 Correct 10 ms 668 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 668 KB Output isn't correct
2 Halted 0 ms 0 KB -