Submission #1298627

#TimeUsernameProblemLanguageResultExecution timeMemory
1298627kian2009Koala Game (APIO17_koala)C++20
4 / 100
3 ms332 KiB
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e2 + 10;

int in[MAXN], out[MAXN];

int minValue(int N, int W) {
    in[0] = 1;
    playRound(in, out);
    for (int i = 1; i < N; i++)
    	if (out[i] == 0)
    		return i;
    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.
    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...