제출 #887850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887850		vjudge1	코알라 (APIO17_koala)	C++17	19 / 100	11 ms	344 KiB

koala

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

const int mxn = 123;
int a[mxn], b[mxn];

int minValue(int n, int w)
{
    a[0] = 1;
    fill(a+1, a+n, 0);
    playRound(a, b);
    if(b[0] <= 1)
    {
        return 0;
    }
    for(int i = 1; i < n; i++)
    {
        if(!b[i])
        {
            return i;
        }
    }
}

int maxValue(int n, int w)
{
    int cnt = 0;
    bool mark[n];
    fill(mark, mark+n, 0);
    while(cnt < (n-1))
    {
        fill(a, a+n, 0);
        for(int i = 0; i < n; i++)
        {
            if(!mark[i])
            {
                a[i] = w/(n-cnt);
            }
        }
        playRound(a, b);
        for(int i = 0; i < n; i++)
        {
            if(mark[i])
            {
                continue;
            }
            if(b[i] <= a[i])
            {
                mark[i] = 1;
                cnt++;
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        if(!mark[i])
        {
            return i;
        }
    }
}

int greaterValue(int n, int w)
{
    
}

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 greaterValue(int, int)':
koala.cpp:67:1: warning: no return statement in function returning non-void [-Wreturn-type]
   67 | }
      | ^
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
   62 | }
      | ^

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