Submission #57281

#	Time	Username	Problem	Language	Result	Execution time	Memory
57281		wilwxk	Koala Game (APIO17_koala)	C++11	4 / 100	10 ms	520 KiB

koala

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

const int MAXN=1000;
int a[MAXN], b[MAXN];

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.
    a[0]=1; for(int i=1; i<N; i++) a[i]=0;
    playRound(a, b);
    if(b[0]<=1) return 0;
    else {
        for(int i=0; i<N; i++) if(b[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.
    }
}

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