제출 #466671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466671		flappybird	코알라 (APIO17_koala)	C++14	19 / 100	16 ms	328 KiB

koala

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

int minValue(int N, int W) {
	int b[100];
	int r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 0;
	b[0] = 1;
	playRound(b, r);
	for (i = 0; i < N; i++) {
		if (r[i] == 0) return i;
	}
    return 0;
}

int maxValue(int N, int W) {
	ll b[100];
	ll r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 1;
	playRound(b, r);
	ll k = 0;
	while (1) {
		ll cnt = 0;
		ll v = -1;
		for (i = 0; i < N; i++) if (r[i] > k) cnt++, v = i;
		if (cnt == 1) return v;
		for (i = 0; i < N; i++) {
			if (r[i] > k) b[i] = N / cnt;
			else b[i] = 0;
		}
		k = N / cnt;
		playRound(b, r);
	}
    return 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