제출 #407358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407358		qwerasdfzxcl	코알라 (APIO17_koala)	C++14	37 / 100	74 ms	328 KiB

koala

#include <bits/stdc++.h>
#include "koala.h"

using namespace std;

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 B[100]={0}, R[100]={0};
    B[0] = 1;
    playRound(B, R);
    for (int i=0;i<N;i++) if (B[i]>=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.
    int B[100] = {0}, R[100] = {0};
    for (int i=0;i<N;i++) B[i] = 1;
    playRound(B, R);
    int prv = 1;
    for (int z=1;z<4;z++){
        int cnt=0;
        for (int i=0;i<N;i++) if (R[i]>prv) cnt++;
        for (int i=0;i<N;i++){
            if (R[i]<=prv) B[i] = 0;
            else B[i] = W/cnt;
        }
        prv = W/cnt;
        playRound(B, R);
    }
    for (int i=0;i<N;i++) if (R[i]==12) return i;
    assert(0);
    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.
    int B[100] = {0}, R[100] = {0};
    B[0] = B[1] = 4;
    playRound(B, R);
    if (min(R[0], R[1])>=5){
        B[0] = B[1] = 8;
        playRound(B, R);
        if (R[0]>R[1]) return 0;
        return 1;
    }
    else if (max(R[0], R[1])<=4){
        B[0] = B[1] = 2;
        playRound(B, R);
        assert(R[0]<=2 || R[1]<=2);
        if (R[0]<=2 && R[1]<=2){
            B[0] = 1, B[1] = 0;
            playRound(B, R);
            if (B[0]>=R[0]) return 1;
            return 0;
        }
        if (R[0]>2) return 0;
        return 1;
    }
    if (R[0]>4) return 0;
    return 1;
}

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