제출 #1140868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140868		anmattroi	코알라 (APIO17_koala)	C++17	4 / 100	3 ms	516 KiB

koala

/**
Task: APIO17_koala (Koala Game)
Link: https://oj.uz/problem/view/APIO17_koala
**/
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
    int *B = new int[N], *R = new int[N];
    fill(B, B+N, 0);
    B[0] = 1;
    playRound(B, R);
    int h = min_element(R, R+N) - R;
    if (R[h] == 0) return h;
    B[0] = 0;
    B[1] = 1;
    playRound(B, R);
    h = min_element(R, R+N) - R;
    return h;
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
}

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