제출 #944839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
944839		Darren0724	코알라 (APIO17_koala)	C++17	19 / 100	13 ms	856 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
    int v[N]{},r[N]{};
    v[0]=1;
    playRound(v,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(N),v1;
    iota(v.begin(),v.end(),0);
    int a[100],b[100];
    while(v.size()>1){
        int k=W/v.size();
        fill(a,a+N,0);
        for(int j:v){
            a[j]=k;
        }
        playRound(a,b);
        for(int j:v){
            if(b[j]>a[j]){
                v1.push_back(j);
            }
        }
        v=v1;
        v1.clear();
    }
    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