제출 #715878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715878		tht2005	코알라 (APIO17_koala)	C++17	30 / 100	92 ms	340 KiB

koala

#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 102;

int B[N], R[N];

int minValue(int N, int W) {
    memset(B, 0, N * sizeof *B);
    B[0] = 1;
    playRound(B, R);
    for(int i = 0; i < N; ++i) {
        if(R[i] <= B[i]) {
            return i;
        }
    }
}

int maxValue(int N, int W) {
    vector<int> S(N);
    iota(S.begin(), S.end(), 0);
    while((int)S.size() > 1) {
        memset(B, 0, N * sizeof *B);
        for(int i : S) {
            B[i] = N / S.size();
        }
        playRound(B, R);
        vector<int> T;
        for(int i : S) {
            if(R[i] > B[i]) {
                T.push_back(i);
            }
        }
        S.swap(T);
    }
    return S[0];
}

int greaterValue(int N, int W) {
    memset(B, 0, N * sizeof *B);
    int l = 1, r = N / 2;
    while(l <= r) {
        int mid = (l + r) >> 1;
        B[0] = B[1] = mid;
        playRound(B, R);
        bool check = (R[0] > B[0]), check1 = (R[1] > B[1]);
        if(check != check1) {
            return check ? 0 : 1;
        }
        if(check) {
            l = mid + 1;
        }
        else {
            r = mid - 1;
        }
    }
}

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.
    }
}

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

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
   60 | }
      | ^

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