Submission #807122

#	Time	Username	Problem	Language	Result	Execution time	Memory
807122		hugo_pm	Koala Game (APIO17_koala)	C++17	19 / 100	13 ms	324 KiB

koala

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

const int MAX_N = 100;
int moi[MAX_N], adverse[MAX_N];
void reset() {
    memset(moi, 0, sizeof(moi));
    memset(adverse, 0, sizeof(adverse));
}
int minValue(int N, int W) {
    reset();
    moi[0] = 1;
    playRound(moi, adverse);
    for (int i = 0; i < N; ++i) {
        if (adverse[i] <= moi[i]) {
            return i;
        }
    }
}

int maxValue(int N, int W) {
    reset();
    vector<bool> isCand(N, true);
    int cnt = N;
    while (cnt > 1) {
        reset();
        int perPos = N/cnt;
        for (int i = 0; i < N; ++i) {
            if (isCand[i]) {
                moi[i] = perPos;
            }
        }
        playRound(moi, adverse);
        cnt = 0;
        for (int i = 0; i < N; ++i) {
            isCand[i] = isCand[i] && (adverse[i] > perPos);
            cnt += isCand[i];
        }
        cerr << cnt << endl;
    }
    int argMax = 0;
    while (!isCand[argMax]) ++argMax;
    return argMax;
}

int greaterValue(int N, int W) {
    reset();
    // 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) {
    reset();
    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:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^

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