Submission #200788

#	Time	Username	Problem	Language	Result	Execution time	Memory
200788		gs14004	코알라 (APIO17_koala)	C++17	4 / 100	11 ms	376 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int B[MAXN], R[MAXN];

int minValue(int N, int W) {
	B[0] = 1;
	playRound(B, R);
	if(count(R, R + N, 0) == 0) return 0;
	return find(R, R + N, 0) - R;
}

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