# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226051 | theStaticMind | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "koala.h"
int B[1000], R[1000];
int minValue(int N, int W) {
for(int i = 0; i < N; i++) B[i] = 1;
playRound(B, R);
int w;
for(int i = 0; i < N; i++) if(R[i] > 1) w = i;
for(int i = 0; i < N; i++) B[i] = 0;
B[w] = W - 1;
B[(w + 1) % N] = 1;
playRound(B, R);
for(int i = 0; i < N; i++){
if(i == w) continue;
if(R[i] <= B[i]) return i;
}
assert(0);
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
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.
}
}