Submission #1075342

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075342		HappyCapybara	Koala Game (APIO17_koala)	C++17	22 / 100	47 ms	728 KiB

koala

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

int minValue(int N, int W) {
    int B[N], R[N];
    for (int i=0; i<N; i++) B[i] = 0;
    B[0] = 1;
    playRound(B, R);
    for (int i=0; i<N; i++){
        if (B[i] >= R[i]) return i;
    }
}

int maxValue(int N, int W) {
    int B[N], R[N];
    for (int i=0; i<N; i++) B[i] = 1;
    playRound(B, R);
    vector<int> v;
    for (int i=0; i<N; i++){
        if (R[i] > 1) v.push_back(i);
    }
    for (int i=0; i<N; i++) B[i] = 0;
    for (int x : v) B[x] = 2;
    playRound(B, R);
    vector<int> w;
    for (int x : v){
        if (R[x] > 2) w.push_back(x);
    }
    for (int i=0; i<N; i++) B[i] = 0;
    for (int x : w) B[x] = 10;
    playRound(B, R);
    for (int x : w){
        if (R[x] > 10) return x;
    }
    return 0;
}

int greaterValue(int N, int W) {
    int B[N], R[N];
    for (int i=0; i<N; i++) B[i] = 0;
    int l = 0, r = 13;
    while (l != r){
        int m = (l+r)/2;
        B[0] = m;
        B[1] = m;
        playRound(B, R);
        if (R[0] > B[0] && R[1] > B[1]) l = m;
        if (R[0] <= B[0] && R[1] <= B[1]) r = m;
        if (R[0] > B[0] && R[1] <= B[1]) return 0;
        if (R[0] <= B[0] && R[1] > B[1]) return 1;
    }
}

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

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