제출 #162107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
162107		Minnakhmetov	코알라 (APIO17_koala)	C++14	4 / 100	7 ms	376 KiB

koala

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

const int N = 205;
int a[N], b[N];

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.

    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    a[0] = 1;

    playRound(a, b);

    // for (int i = 0; i < n; i++) {
    //     cout << b[i];
    // }
    // cout << "\n";

    int x = 0;
    while (b[x])
        x++;

    return x;
}

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