제출 #501102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501102		Stickfish	Koala Game (APIO17_koala)	C++17	19 / 100	60 ms	440 KiB

koala

#include "koala.h"
#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 101;
int b[MAXN];
int r[MAXN];

int minValue(int N, int W) {
    b[0] = 1;
    for (int i = 1; i < N; ++i)
        b[i] = 0;
    playRound(b, r);
    for (int i = 0; i < N; ++i) {
        if (r[i] == 0)
            return i;
    }
    return 0;
}

int maxValue(int N, int W) {
    vector<int> v;
    for (int i = 0; i < N; ++i)
        v.push_back(i);
    while (v.size() > 1) {
        for (int i = 0; i < N; ++i)
            b[i] = 0;
        int lb = 0, ub = (W / v.size()) + 1;
        while (ub - lb > 1) {
            int mb = (lb + ub) / 2;
            if ((mb + 1) * (mb + 2) / 2 < N)
                lb = mb;
            else
                ub = mb;
        }
        int t = lb;
        for (auto i : v)
            cerr << i << ' ';
        cerr << "| " << t << endl;
        
        for (auto i : v)
            b[i] = t;
        playRound(b, r);
        vector<int> nv;
        for (auto i : v) {
            if (r[i] > t)
                nv.push_back(i);
        }
        v = nv;
    }
    return v[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: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53