제출 #406584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406584		BERNARB01	코알라 (APIO17_koala)	C++17	4 / 100	5 ms	200 KiB

koala

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

using namespace std;

const int N = 100;
int r[N], b[N], p[N];

int minValue(int n, int w) {
	r[0] = 1;
	playRound(r, b);
	for (int i = 0; i < n; i++) {
		if (r[i] >= b[i]) {
			return i;
		}
	}
	return 0;
}

int maxValue(int n, int w) {
	vector<int> id(n);
	for (int i = 0; i < n; i++) {
		id[i] = i;
	}
	int c = 1;
	while (id.size() > 1) {
		memset(r, 0, sizeof r);
		for (int i : id) {
			r[i] = c;
		}
		r[id[0]] += n - id.size() * c;
		playRound(r, b);
		vector<int> new_id;
		for (int i : id) {
			if (r[i] < b[i]) {
				new_id.push_back(i);
			}
		}
		swap(new_id, id);
		c++;
	}
	return id[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: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53