제출 #226103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
226103		theStaticMind	코알라 (APIO17_koala)	C++14	0 / 100	3090 ms	384 KiB

koala

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

int B[105], R[105];

int minValue(int N, int W) {
	return 0;
}

vector<bool> rem(105, true);
void recalc(int N, int W){
    int sum = 0;
    for(int i = 0; i < N; i++) if(rem[i]) sum++;
    for(int i = 0; i < N; i++){
        if(rem[i]) B[i] = W / sum;
        else B[i] = 0;
    }
}

int maxValue(int N, int W) {

    for(int t = 0; t < 4; t++){
        recalc(N, W);
        playRound(B, R);
        for(int i = 0; i < N; i++){
            if(R[i] <= B[i]) rem[i] = false;
        }
    }

    for(int i = 0; i < N; i++){
        if(rem[i]) return i;
    }
    while(true){
      ;
    }
}

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: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53