Submission #501076

#	Time	Username	Problem	Language	Result	Execution time	Memory
501076		Stickfish	코알라 (APIO17_koala)	C++17	4 / 100	5 ms	288 KiB

koala

#include "koala.h"
#include <iostream>
using namespace std;

const int MAXN = 101;
int b[MAXN];
int r[MAXN];

int minValue(int N, int W) {
    b[0] = 1;
    for (int i = 1; i < N; ++i)
        b[i] = 0;
    playRound(b, r);
    for (int i = 0; i < N; ++i) {
        //cerr << r[i] << ' ';
        //cerr << endl;
        if (r[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