# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983852 | vjudge1 | Koala Game (APIO17_koala) | C++17 | 4 ms | 460 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 v[N], w[N];
v[0] = 1;
w[0] = 0;
for (int i = 1; i < N; i++) v[i] = 0, w[i] = 0;
playRound(v, w);
for (int i = 0; i < N; i++) {
if (!w[i]) return i;
}
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int maxValue(int N, int W) {
int v[N], w[N];
int l = 0, r = N, md, ans;
while (l <= r) {
md = (l + r) / 2;
v[0] = md + 1;
w[0] = 0;
for (int i = 1; i < N; i++) v[i] = md, w[i] = 0;
playRound(v, w);
bool f = 0;
for (int i = 0; i < N; i++) {
if (w[i] == md) f = 1;
}
if (!f) r = md - 1;
else ans = md, l = md + 1;
}
// 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 v[N], w[N];
int l = 0, r = N, md, ans;
while (l <= r) {
md = (l + r) / 2;
v[0] = md;
v[1] = md;
w[0] = 0;
for (int i = 1; i < N; i++) v[i] = md, w[i] = 0;
playRound(v, w);
if (v[0] > md && v[1] > md) l = md + 1;
else if (v[0] <= md && v[1] <= md) r = md - 1;
else {
if (v[0] > v[1]) return 0;
else return 1;
}
}
// 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)
# | 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... |