Submission #58049

#	Time	Username	Problem	Language	Result	Execution time	Memory
58049		awake	Koala Game (APIO17_koala)	C++14	19 / 100	26 ms	720 KiB

koala

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

ll B[105], R[105];

void debug() {
	for (ll i = 0; i < 100; i++) {
		cout << R[i] << " \n"[i == 100-1];
	}
}

int minValue(int N, int W) {
	memset(B, 0, sizeof(B));
	B[0] = 1;
	playRound(B, R);
	for (ll i = 0; i < N; i++) {
		if (R[i] <= B[i]) {
			return i;
		}
	}
}

int maxValue(int N, int W) {
	memset(B, 0, sizeof(B));
	for (ll i = 0; i < N; i++) {
		B[i] = 1;
	}
	playRound(B, R);
	memset(B, 0, sizeof(B));
	for (ll i = 0; i < N; i++) {
		if (R[i] >= 2) {
			B[i] = 2;
		}
	}
	playRound(B, R);
	memset(B, 0, sizeof(B));
	for (ll i = 0; i < N; i++) {
		if (R[i] >= 3) {
			B[i] = 4;
		}
	}
	playRound(B, R);
	memset(B, 0, sizeof(B));
	ll count = 0;
	for (ll i = 0; i < N; i++) {
		if (R[i] >= 5) {
			B[i] = 11;
		}
	}
	playRound(B, R);
	for (ll i = 0; i < N; i++) {
		if (R[i] >= 12) {
			return i;
		}
	}
}

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.
	}
}

Compilation message (stderr)

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:46:5: warning: unused variable 'count' [-Wunused-variable]
  ll count = 0;
     ^~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53