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 "prize.h"
using namespace std;
int find_best(int n) {
for (int i = 0; i < n; ++ i ) {
int left = i+1, right = n-1;
vector <int> val = ask(i);
int poz_right = i;
if (val[0] + val[1] == 0) {
return i;
}
while (left <= right) {
int mid = (left + right) / 2;
vector <int> cnt = ask(mid);
bool Type = (cnt[0] + cnt[1] == val[0] + val[1]);
if (Type) {
int cate_sunt = cnt[0] - val[0];
if (cate_sunt == 0) {
poz_right = mid;
left = mid + 1;
}
else right = mid - 1;
}
else {
right = mid - 1;
}
}
i = poz_right;
}
return n-1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |