Submission #401131

#	Time	Username	Problem	Language	Result	Execution time	Memory
401131		A_D	코알라 (APIO17_koala)	C++14	4 / 100	58 ms	200 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
int minValue(int N, int W) {
    int ans=0;
    int B[N];
    int R[N];
    memset(B,0,sizeof(B));
    memset(R,0,sizeof(R));
    B[0]=1;
    playRound(B,R);
    for(int i=1;i<N;i++)if(R[i]==0)ans=i;
    return ans;
}

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) {
        int B[N];
        int R[N];
        memset(B,0,sizeof(B));
        for(int i=0;i<N;i++){
            int l=100,r=199;
            while(l<=r){
                int mid=(l+r)/2;
                B[i]=mid;
                playRound(B,R);
                if(R[i]>mid){
                    P[i]=mid-100+1;
                }
            }
            B[i]=0;
        }
        
    } 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: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53