Submission #226089

#	Time	Username	Problem	Language	Result	Execution time	Memory
226089		theStaticMind	Koala Game (APIO17_koala)	C++14	4 / 100	14 ms	640 KiB

koala

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

int B[101], R[101];

int minValue(int N, int W) {

    for(int i = 0; i < N; i++) B[i] = 1;

    playRound(B, R);

    for(int i = 0; i < N; i++) B[i] = 0;
    for(int i = 0; i < N; i++){
        if(R[i] > 1){
            B[i] = 1;
            break;
        }
    }

    playRound(B, R);

    for(int i = 0; i < N; i++){
        if(R[i] <= B[i]) return i;
    }
    assert(0);

}

vector<bool> rem(101, true);
void recalc(int N, int W){
    int sum = 0;
    for(int i = 0; i < N; i++) if(rem[i]) sum++;
    for(int i = 0; i < N; i++){
        if(rem[i]) B[i] = min(W / sum, 12);
        else B[i] = 0;
    }
}

int maxValue(int N, int W) {

    for(int t = 0; t < 4; t++){
        recalc(N, W);
        playRound(B, R);
        for(int i = 0; i < N; i++){
            if(R[i] <= B[i]) rem[i] = false;
        }
    }

    for(int i = 0; i < N; i++){
        if(rem[i]) return i;
    }

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

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