제출 #736514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
736514		vjudge1	코알라 (APIO17_koala)	C++11	19 / 100	15 ms	320 KiB

koala

#include "koala.h"

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

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.
        int A[N], B[N];
        for (int i = 0; i < N; i++) A[i] = i == 0;
        playRound(A, B);
        for (int i = 0; i < N; i++) {
                if (B[i] <= A[i]) return i;
        }
        return -1;
}

int maxValue(int N, int W) {
        // TODO: Implement Subtask 2 solution here.
        // You may leave this function unmodified if you are not attempting this
        // subtask.
        vector<int> candidates(N);
        iota(candidates.begin(), candidates.end(), 0);
        while (candidates.size() != 1) {
                int cnt = W / candidates.size();
                int A[N], B[N];
                for (int i = 0; i < N; i++) A[i] = 0;
                for (int i : candidates) A[i] = cnt;
                playRound(A, B);
                vector<int> nc;
                for (int i : candidates) {
                        if (B[i] > A[i]) nc.emplace_back(i);
                }
                candidates = nc;
        }
        return candidates[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