제출 #652474

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

koala

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

using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())

int N;

vi playRound(vi BV)
{
    int B[N];
    int R[N];
    for(int i = 0; i < N; i++)
    {
        B[i] = BV[i];
    }
    playRound(B, R);

    vi RV(N);
    for(int i = 0; i < N; i++)
        RV[i] = R[i];

    return RV;
}

int minValue(int N_, int W) {
    N = N_;
    
    vi B(N, 0);
    B[0] = 1;
    vi R = playRound(B);

    for(int i = 0; i < N; i++)
        if(R[i] == 0)
            return i;


    return 0;
}

int maxValue(int N_, int W) {
    N = N_;
    // 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) {
    N = N_;
    // 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) {
    N = N_;
    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