Submission #377683

#	Time	Username	Problem	Language	Result	Execution time	Memory
377683		parsabahrami	Koala Game (APIO17_koala)	C++17	15 / 100	19 ms	384 KiB

koala

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

using namespace std;

int A[200], B[200];

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.
    return 0;
}

int maxValue(int N, int W) {
    vector<int> vec(N);
    iota(vec.begin(), vec.end(), 0);
    while (vec.size() > 1) {
        int x = W / (vec.size());
        memset(A, 0, sizeof A);
        for (int id : vec) A[id] = x;
        playRound(A, B);
        vector<int> tmp;
        for (int id : vec) 
            if (A[id] < B[id]) tmp.push_back(id);
        vec.swap(tmp);
    }
    return vec.back();
}

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: 0 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53