Submission #251810

#	Time	Username	Problem	Language	Result	Execution time	Memory
251810		atoiz	Koala Game (APIO17_koala)	C++14	37 / 100	100 ms	520 KiB

koala

#include "koala.h"
#include <cassert>
#include <algorithm>
#include <iostream>

using namespace std;

#define FOR(i, a, b) for (int i = a; i <= b; ++i)
int A[100], B[100];

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    FOR(i, 1, N - 1) A[i] = 0;
    A[0] = 1;
    playRound(A, B);
    FOR(i, 0, N - 1) if (A[i] >= B[i]) return i;
    assert(false);
    return 0;
}

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.
    bool C[N];
    FOR(i, 0, N - 1) C[i] = 1;

    for (int _ = 0; _ < 4; ++_) {
        int cnt = count(C, C + N, 1);
        FOR(i, 0, N - 1) A[i] = C[i] * N / cnt;
        playRound(A, B);
        FOR(i, 0, N - 1) C[i] = C[i] && (A[i] < B[i]);
    }

    assert(count(C, C + N, 1) == 1);
    FOR(i, 0, N - 1) if (C[i]) return i;
    assert(false);
    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.
    int lo = 1, hi = 7;
    while (true) {
        assert(lo <= hi);
        int mid = (lo + hi) >> 1;
        FOR(i, 2, N - 1) A[i] = 0;
        A[0] = A[1] = mid + (mid == 7);
        playRound(A, B);
        if ((A[0] < B[0]) != (A[1] < B[1])) return A[1] < B[1];
        if (A[0] < B[0]) lo = mid + 1;
        else hi = mid - 1;
    }
    assert(false);
    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: 15 / 15
• Subtask 3: 18 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53