제출 #226147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
226147		theStaticMind	코알라 (APIO17_koala)	C++14	33 / 100	109 ms	520 KiB

koala

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

int B[105], R[105];

int minValue(int N, int W) {

    for(int i = 0; i < N; i++) B[i] = 1;

    playRound(B, R);

    for(int i = 0; i < N; i++) B[i] = 0;
    for(int i = 0; i < N; i++){
        if(R[i] > 1){
            B[i] = 1;
            break;
        }
    }

    playRound(B, R);

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

}


int maxValue(int N, int W) {
    bool rem[105];
    for(int i = 0; i < N; i++) rem[i] = true;
    auto recalc = [&](){
        int sum = 0;
        for(int i = 0; i < N; i++) if(rem[i]) sum++;
        for(int i = 0; i < N; i++){
            if(rem[i]) B[i] = W / sum;
            else B[i] = 0;
        }
    };

    for(int t = 0; t < 4; t++){
        recalc();
        playRound(B, R);
        for(int i = 0; i < N; i++){
            if(R[i] <= B[i]) rem[i] = false;
        }
    }

    for(int i = 0; i < N; i++){
        if(rem[i]) return i;
    }
    assert(0);
}

bool comp(int x, int y){
    int l = 1, r = 8;

    while(l <= r){
        int mid = (l + r) / 2;

        for(int i = 0; i < 100; i++) B[i] = 0;
        B[x] = B[y] = mid;
        playRound(B, R);

        if(R[x] <= B[x] && R[y] <= B[y]) r = mid - 1;
        else if(R[x] > B[x] && R[y] > B[y]) l = mid + 1;
        else{
            return R[x] <= B[x];
        }

    }
    assert(0);
}

int greaterValue(int N, int W) {
    if(comp(0, 1)) return 1;
    else 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: 15 / 15
• Subtask 3: 14 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53