제출 #977610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977610		thelegendary08	코알라 (APIO17_koala)	C++17	0 / 100	1 ms	344 KiB

koala

#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 round[N];
    round[N-1] = 0;
    for(int i = 0;i<N-1;i++)round[i] = 1;
    int ret[N];
    playRound(round, ret);
    bool isfirst = 1;
    int zero = 0;
    for(int i = 0;i<N;i++){
        if(ret[i] == 2){
            isfirst = 0;
        }
        if(ret[i] == 0)zero = i;
    }
    if(isfirst)return 0;
    else return zero;
}

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