# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075332 | HappyCapybara | Koala Game (APIO17_koala) | C++17 | 42 ms | 468 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"
#include<bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
int B[N], R[N];
for (int i=0; i<N; i++) B[i] = 0;
B[0] = 1;
playRound(B, R);
for (int i=0; i<N; i++){
if (B[i] >= R[i]) return i;
}
}
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) {
int B[N], R[N];
for (int i=0; i<N; i++) B[i] = 0;
int l = 0, r = 13;
while (l != r){
int m = (l+r)/2;
B[0] = m;
B[1] = m;
playRound(B, R);
if (R[0] > B[0] && R[1] > B[1]) l = m;
if (R[0] <= B[0] && R[1] <= B[1]) r = m;
if (R[0] > B[0] && R[1] <= B[1]) return 0;
if (R[0] <= B[0] && R[1] > B[1]) return 1;
}
}
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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |