Submission #653622

#	Time	Username	Problem	Language	Result	Execution time	Memory
653622		Kripton	코알라 (APIO17_koala)	C++14	0 / 100	10 ms	336 KiB

koala

#include "koala.h"
#include <vector>
#include <iostream>
using namespace std;
int minValue(int N, int W)
{
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int maxValue(int N, int W)
{

    int B[101],R[101],i,j;
    vector <int> v,newv;
    for(i=1; i<=N; i++)
        v.push_back(i);
    for(i=1;; i++)
    {
        newv.clear();
        for(j=0; j<N; j++)
            B[j]=0;
        int cw=W;
        for(auto it:v)
        {
            if(cw<i)
                break;
            B[it]=i;
            cw-=i;
        }
        playRound(B,R);
        for(j=0; j<N; j++)
            if(R[j]==i+1)
                newv.push_back(j);
        v=newv;
        if(v.size()==1)
            break;
    }
    return v[0];
}

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.
    }
}

Compilation message (stderr)

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:46:1: warning: no return statement in function returning non-void [-Wreturn-type]
   46 | }
      | ^

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