Submission #111791

#	Time	Username	Problem	Language	Result	Execution time	Memory
111791		dndhk	Koala Game (APIO17_koala)	C++14	37 / 100	101 ms	792 KiB

koala

#include "koala.h"

int B[100], R[100];

int minValue(int N, int W) {
    B[99] = 1;
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]==0){
            return i;
        }
    }
    return 99;
}

int maxValue(int N, int W) {
    for(int i=0; i<N; i++){
        B[i] = 1;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]==2){
            B[i] = 2;
        }else{
            B[i] = 0;
        }
    }
    playRound(B, R);
    int cnt = 25;
    for(int i=0; i<N; i++){
        if(R[i]>=3){
            B[i] = 3;
        }else if(B[i]!=0 && cnt>0){
            B[i] = 1;
            cnt--;
        }else B[i] = 0;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]>=4){
            B[i] = 13;
        }else   B[i] = 0;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]>=14){
            return i;
        }
    }
    return -1;
}

int chk(int x){
    B[0] = B[1] = x;
    playRound(B, R);
    if(R[0]>x && R[1]>x){
        return 2;
    }else if(R[0]<=x && R[1]<=x){
        return 3;
    }else{
        if(R[0]>R[1])   return 0;
        return 1;
    }
}

int greaterValue(int N, int W) {
    int t = chk(3);
    if(t==0)    return 0;
    if(t==1)    return 1;
    if(t==2){
        t = chk(5);
        if(t==0)    return 0;
        if(t==1)    return 1;
        if(t==2){
            t = chk(8);
            if(t==0)    return 0;
            return 1;
        }
    }else{
        t = chk(2);
        if(t==0)    return 0;
        if(t==1)    return 1;
        if(t==3){
            t = chk(1);
            if(t==0)    return 0;
            return 1;
        }
    }
    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