Submission #385149

#	Time	Username	Problem	Language	Result	Execution time	Memory
385149		phathnv	코알라 (APIO17_koala)	C++11	19 / 100	19 ms	492 KiB

koala

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

using namespace std;

int minValue(int N, int W) {
    int b[N], r[N];
    memset(b, 0, sizeof(b));
    b[0] = 1;
    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> candidates;
    for(int i = 0; i < N; i++)
        candidates.push_back(i);
    while (candidates.size() > 1){
        int b[N], r[N];
        memset(b, 0, sizeof(b));
        int c = min(12, W / (int) candidates.size());
        for(int ind : candidates)
            b[ind] = c;
        playRound(b, r);
        vector<int> nxt;
        for(int i = 0; i < N; i++)
            if (b[i] == c && r[i] > c)
                nxt.push_back(i);
        candidates = nxt;
    }
    return candidates.front();
}

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