제출 #557659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557659		nutella	코알라 (APIO17_koala)	C++17	71 / 100	51 ms	336 KiB

koala

#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxN = 100;
int B[maxN], R[maxN];

void cl() {
    memset(B, 0, sizeof(B));
    memset(R, 0, sizeof(R));
}

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.
    cl();
    B[0] = 1;
    playRound(B, R);
    if (R[0]) {
        return int(min_element(R, R + N) - R);
    } else {
        return 0;
    }
}

int maxValue(int N, int W) {
    // return i such as P[i] = n
    vector<int> left(N);
    iota(begin(left), end(left), 0);
    while (size(left) > 1) {
        int x = W / (int) size(left);
        cl();
        for (int i: left)
            B[i] = x;
        playRound(B, R);
        vector<int> tmp;
        for (int i: left)
            if (B[i] < R[i])
                tmp.push_back(i);
        swap(tmp, left);
    }
    assert(size(left) == 1);
    return left[0];
}

int greaterValue(int N, int W) {
    // compare P[0] and P[1]
    int l = 0, r = W / 8;
    while (l + 1 < r) {
        int m = (l + r) >> 1;
        cl();
        B[0] = B[1] = m;
        playRound(B, R);
        bool took1 = R[0] > B[0];
        bool took2 = R[1] > B[1];
        if (took1 && took2) l = m;
        else if (!took1 && !took2) r = m;
        else if (took1) return 0;
        else return 1;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == N) {
        vector<bool> used(N);
        for (int v = N; v > 0; --v) {
            vector<int> left;
            for (int i = 0; i < N; ++i) {
                if (!used[i])
                    left.push_back(i);
            }
            while (size(left) > 1) {
                int x = W / (int) size(left);
                int l = 0, r = x + 1;
                while (l + 1 < r) {
                    int mid = (l + r) >> 1;
                    cl();
                    for (int i: left)
                        B[i] = mid;
                    playRound(B, R);
                    vector<int> tmp;
                    for (int i: left)
                        if (B[i] < R[i])
                            tmp.push_back(i);
                    if (!tmp.empty()) l = mid;
                    else r = mid;
                }
                int mid = l;
                cl();
                for (int i: left)
                    B[i] = mid;
                playRound(B, R);
                vector<int> tmp;
                for (int i: left)
                    if (B[i] < R[i])
                        tmp.push_back(i);
                swap(tmp, left);
            }
            if (size(left) != 1) {
                cout << v << endl;
            }
            assert(size(left) == 1);
            P[left[0]] = v;
            used[left[0]] = true;
        }
    } else {
        vector<bool> used(N);
        for (int v = N; v > 0; --v) {
            vector<int> left;
            for (int i = 0; i < N; ++i) {
                if (!used[i])
                    left.push_back(i);
            }
            while (size(left) > 1) {
                int x = W / (int) size(left);
                cl();
                for (int i: left)
                    B[i] = x;
                playRound(B, R);
                vector<int> tmp;
                for (int i: left)
                    if (B[i] < R[i])
                        tmp.push_back(i);
                swap(tmp, left);
            }
            assert(size(left) == 1);
            P[left[0]] = v;
            used[left[0]] = true;
        }
    }
}

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