Submission #984204

#	Time	Username	Problem	Language	Result	Execution time	Memory
984204		Unforgettablepl	Koala Game (APIO17_koala)	C++17	33 / 100	61 ms	852 KiB

koala

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

//#define int long long

void playRound(int *B, int *R);

int minValue(int N, int W) {
    int arr[100];fill(arr,arr+100,0);
    int res[100];fill(res,res+100,0);
    arr[0] = 1;
    playRound(arr,res);
    for(int i=0;i<N;i++)if(res[i]<=arr[i])return i;
}

int maxValue(int N, int W) {
    vector<int> poss(N);iota(poss.begin(), poss.end(),0);
    while(poss.size()>1){
        int arr[100];fill(arr,arr+100,0);
        int res[100];fill(res,res+100,0);
        int distrib = W/poss.size();
        for(int&i:poss)arr[i]=distrib;
        playRound(arr,res);
        poss.clear();
        for(int i=0;i<N;i++)if(arr[i] and res[i]>arr[i])poss.emplace_back(i);
    }
    return poss[0];
}

int greaterValue(int N, int W) {
    int lo = 1, hi = 8;
    while (true) {
        int mid = (lo + hi) / 2;
        int arr[100];
        fill(arr, arr + 100, 0);
        int res[100];
        fill(res, res + 100, 0);
        arr[0] = arr[1] = mid;
        playRound(arr, res);
        bool zerogud = res[0] > arr[0];
        bool onegud = res[1] > arr[1];
        if (zerogud == onegud) {
            if (zerogud) {
                lo = mid + 1;
            } else {
                hi = mid - 1;
            }
            continue;
        }
        return onegud;
    }
}

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:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

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