Submission #1228221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228221		abdelhakim	Koala Game (APIO17_koala)	C++20	4 / 100	4 ms	408 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int minValue(int N, int W) {
    int arr[N];
    for (int i=0;i<N;i++) arr[i]=1;
    int r[N];
    playRound(arr,r);
    ll f=0;
    for (int i=0;i<N;i++)
    {
        if(r[i] > 1 && !f)
        {
            f=1;
            arr[i]=1;
        }
        else
        {
            arr[i]=0;
        }
    }
    playRound(arr,r);
    for (int i=0;i<N;i++)
    {
        if(r[i]==0)
        {
            return i;
        }
    }
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    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.
    }
}

Compilation message (stderr)

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

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