제출 #399659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
399659		KoD	코알라 (APIO17_koala)	C++17	14 / 100	49 ms	456 KiB

koala

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

int minValue(int N, int W) {
    int B[100] = {}, R[100] = {};
    B[0] = 1;
    playRound(B, R);
    for (int i = 0; i < N; ++i) {
        if (R[i] <= B[i]) {
            return i;
        }
    }
    assert(false);
    return -1;
}

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) {
    int B[100] = {}, R[100] = {};
    
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        int B[100] = {}, R[100] = {};
        const auto less = [&](const int i, const int j) {
            B[i] = B[j] = W / 2;
            playRound(B, R);
            B[i] = B[j] = 0;
            return R[j] > W / 2;
        };
        int order[100] = {};
        std::iota(order, order + N, 0);
        auto dfs = [&](auto&& dfs, const int l, const int r) -> void {
            if (r - l == 1) return;
            const auto m = (l + r) / 2;
            dfs(dfs, l, m);
            dfs(dfs, m, r);
            std::inplace_merge(order + l, order + m, order + r, less);
        };
        dfs(dfs, 0, N);
        for (int i = 0; i < N; ++i) {
            P[order[i]] = i + 1;
        }
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:25:9: warning: unused variable 'B' [-Wunused-variable]
   25 |     int B[100] = {}, R[100] = {};
      |         ^
koala.cpp:25:22: warning: unused variable 'R' [-Wunused-variable]
   25 |     int B[100] = {}, R[100] = {};
      |                      ^
koala.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^

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