Submission #1180724

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180724		omarrrr	코알라 (APIO17_koala)	C++20	37 / 100	28 ms	468 KiB

koala

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

using namespace std;



int B[100],R[100],N;
int minValue(int n,int w){
    for(int i=0;i<n;i++){
        B[i]=0;
        R[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 tot=n;
    int x=w/tot,res=0;
    for(int i=0;i<n;i++){
        B[i]=1;
    }
    while(tot!=1){
        playRound(B,R);
        tot=0;
        for(int i=0;i<n;i++){
            if(R[i]>x){
                tot++;
            }
            B[i]=0;
        }
        int y=x;
        x=w/tot;
        for(int i = 0 ; i<n;i++){
            if(R[i]>y){
                B[i]=x;
                res=i;
            }
        }
    }
    return res;
}

int greaterValue(int n,int w){
    int l=1,r=13,mid;
    while(l<=r){
        mid=(l+r)/2;
        for(int i=0;i<n;i++){
            B[i]=0;
            R[i]=0;
        }
        B[0]=B[1]=mid;
        playRound(B,R);
        if(R[0]>R[1]){
            return 0;
        }else if(R[1]>R[0]){
            return 1;
        }else if(R[1]>mid){
            l=mid+1;
        }else{
            r=mid-1;
        }
    }
    return 0;
}

bool cmp(int x,int y){
    for(int i=0;i<N;i++){
        B[i]=0;
    }
    B[x]=B[y]=N;
    playRound(B,R);

    return R[x]>R[y];

}

void allValues(int n,int w,int* p){
    N=n;
    int pos[n];
    for(int i=0;i<n;i++){
        pos[i]=i;
    }
    sort(pos,pos+n,cmp);
    for(int i=0;i<n;i++){
        p[pos[i]]=i+1;
    }
}

Compilation message (stderr)

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

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