제출 #945165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945165		TAhmed33	코알라 (APIO17_koala)	C++98	0 / 100	1 ms	344 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
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.
    int A[N], B[N];
    for (int i = 0; i < N; i++) A[i] = 1;
    playRound(A, B);
    for (int i = 0; i < N; i++) A[i] = 0;
    int q = 0;
    bool sad[N]; memset(sad, 0, sizeof(sad));
    for (int i = 0; i < N; i++) {
        if (B[i] && !q) {
            q = 1; A[i] = 1;
        } else if (!B[i]) {
            sad[i] = 1;
            A[i] = 1;
        }
    }
    playRound(A, B);
    for (int i = 0; i < N; i++) {
        if (!B[i] && sad[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.
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53