Submission #364938

#TimeUsernameProblemLanguageResultExecution timeMemory
364938kostia244Koala Game (APIO17_koala)C++17
4 / 100
6 ms364 KiB
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
int minValue(int n, int __w) {
	vector<int> take(n), res(n);
	take[0] = 1;
	playRound(take.data(), res.data());
    return min_element(all(res))-res.begin();
}

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) {
    // 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.
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...