# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347535 | happypotato | Koala Game (APIO17_koala) | C++17 | 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 minValue(int N, int W) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int b[N], r[N];
b[0] = 1;
for (int i = 1;i < N;i++) b[i] = 0;
playRound(b, r);
if (r[0] < 2) return 0;
for (int i = 1;i < N;i++) {
if (r[i] == 0) return i;
}
return -1;
}
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.
int b[N], r[N];
vector<int> v;
for (int i = 0;i < N;i++) {
b[i] = 1;
v.push_back(i);
}
while (!v1.empty()) {
for (int i = 0;i < N;i++) b[i] = 0;
for (int i : v) b[i] = N / v.size();
playRound(b, r);
vector<int> v2 = v;
v.clear();
for (int i : v2) {
if (r[i] > b[i]) {
v.push_back(i);
}
}
}
return v[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.
}
}