제출 #1336681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1336681		mayac	코알라 (APIO17_koala)	C++20	33 / 100	27 ms	476 KiB

koala

#include <iostream>
#include <vector>
#include "koala.h"
using namespace std;


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

int maxValue(int N, int W) {
    int B[100],R[100];
    vector<int> v;
    for(int i=0;i<N;i++)v.push_back(i);
    while(v.size()>1){
        for(int i=0;i<N;i++)B[i]=0;
        for(int i:v)B[i]=min(14,int(100/v.size()));
        playRound(B,R);
        vector<int> t;
        for(int i=0;i<N;i++){
            if(B[i]>0&&R[i]>B[i])t.push_back(i);
        }
        v=t;
        
    }
    
    return v[0];
}

int greaterValue(int N, int W) {
    int B[100],R[100];
    for(int i=0;i<N;i++)B[i]=0;
    int cur=0;
    for(int step=8;step>0;step/=2){
        cur+=step;
        B[0]=cur;
        B[1]=cur;
        playRound(B,R);
        if(R[0]>cur&&R[1]<=cur)return 0;
        if(R[1]>cur&&R[0]<=cur)return 1;
        if(R[0]<cur)cur-=step;
    }
    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.
    }
}

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
   15 | }
      | ^

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 14 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53