Submission #106910

#TimeUsernameProblemLanguageResultExecution timeMemory
106910AngusRitossaKoala Game (APIO17_koala)C++14
4 / 100
9 ms384 KiB
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[500], r[500], n, w;
int minValue(int N, int W) 
{
    n = N, w = W;
    b[0] = 1;
    playRound(b, r);
    for (int i = 0; i < n; i++) if (b[i] >= r[i]) return i;
    return 0;
}

int maxValue(int N, int W) {
    n = N, w = W;
    return 0;
}

int greaterValue(int N, int W) {
    n = N, w = W;
    return 0;
}

void allValues(int N, int W, int *P) {
    n = N, w = W;
    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...