제출 #401167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
401167		Hazem	코알라 (APIO17_koala)	C++14	14 / 100	79 ms	328 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.
    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 B[100],R[100];

int greaterValue(int N, int W) {
    
    int l = 0,r = 20;
    while(l<r){

        int mid = (l+r+1)/2;
        B[0] = B[1] = mid;
        playRound(B,R);

        if(R[0]!=R[1])
            return R[0]<R[1];
        
        if(R[0])l = mid;
        else r = mid-1;
    }   
    
    int cnt = -1;
    while(1)
        cnt++;
    return cnt;
}

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: 14 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53