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 b[500], r[500], n, w;
int minValue(int N, int W)
{
n = N, w = W;
b[0] = 1;
playRound(b, r);
for (int i = 0; i < n; i++) if (b[i] >= r[i]) return i;
return 0;
}
int maxValue(int N, int W)
{
n = N, w = W;
return 0;
}
int greaterValue(int N, int W)
{
n = N, w = W;
// TODO: Find optimal numbers
for (int i = 1; 1; i++)
{
b[0] = b[1] = i;
playRound(b, r);
if (b[0] >= r[0] && b[1] < r[1]) return 1;
if (b[0] < r[0] && b[1] >= r[1]) return 1;
}
return 0;
}
void allValues(int N, int W, int *P) {
n = N, w = W;
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.
}
}
# | 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... |