제출 #1354623

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1354623		ramzialoulou	코알라 (APIO17_koala)	C++20	4 / 100	2 ms	344 KiB

koala

#include <bits/stdc++.h>
#include "koala.h"

using namespace std;

const int N = 109;
int B[N], R[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.
    B[0] = 1;
    playRound(B, R);
    for (int i = 0; i < N; i++) {
      if (R[i] <= B[i]) {
        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.
    }
}

• 서브태스크 1: 4 / 4
• 서브태스크 2: 0 / 15
• 서브태스크 3: 0 / 18
• 서브태스크 4: 0 / 10
• 서브태스크 5: 0 / 53