Submission #399633

#	Time	Username	Problem	Language	Result	Execution time	Memory
399633		KoD	Koala Game (APIO17_koala)	C++17	4 / 100	58 ms	320 KiB

koala

#include <bits/stdc++.h>
#include "koala.h"

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

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) {
    int B[100] = {}, R[100] = {};
    B[0] = B[1] = W / 2;
    playRound(B, R);
    if (R[0] > B[0]) return 0;
    if (R[1] > B[1]) return 1;
    return 1 - minValue(N, W);
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        int B[100] = {}, R[100] = {};
        const auto less = [&](const int i, const int j) {
            B[i] = B[j] = 100;
            playRound(B, R);
            B[i] = B[j] = 0;
            return R[j] > 100;
        };
        int order[100] = {};
        for (int i = 0; i < N; ++i) {
            order[i] = i;
        }
        std::sort(order, order + N, less);
        for (int i = 0; i < N; ++i) {
            P[order[i]] = i + 1;
        }
    } 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