제출 #108192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108192		wilwxk	코알라 (APIO17_koala)	C++11	37 / 100	66 ms	524 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=205;
int v[MAXN];
int v2[MAXN];

int minValue(int n, int w) {
    v[0]=1;
    playRound(v, v2);
    for(int i=0; i<n; i++) if(v2[i]<=v[i]) return i;
}

int maxValue(int n, int w) {
    int ok[MAXN];
    for(int i=0; i<n; i++) ok[i]=1;
    int cnt=n;
    while(cnt!=1) {
        for(int i=0; i<n; i++) {
            if(ok[i]) v[i]=(w/cnt);
            else v[i]=0;
        }
        playRound(v, v2);
        for(int i=0; i<n; i++) {
            if(ok[i]&&v2[i]<=v[i]) ok[i]=0, cnt--;
        }
    }
    for(int i=0; i<n; i++) if(ok[i]) return i;
}

int greaterValue(int n, int w) {
    int ini=1; int fim=min(14, n);
    while(ini<fim) {
        int mid=(ini+fim)/2;
        v[0]=mid; v[1]=mid;
        playRound(v, v2);
        int aa=v2[0]>mid;
        int bb=v2[1]>mid;
        // printf("%d %d - %d >> %d %d\n", ini, fim, mid, aa, bb);
        if(aa!=bb) return bb;
        if(aa&&bb) ini=mid+1;
        else fim=mid-1;
    }
    return ini;
}

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:13:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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