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<bits/stdc++.h>
#include "prize.h"
using namespace std;
int can(int k) {
vector<int> cer = ask(k);
if(cer[0] == 0 && cer[1] == 0) return 2;
return (cer[0] == 0);
}
int find_best(int n) {
int kk = -1;
for(int i = n/2; i >= 1; i /= 2) {
while(kk + i <= n) {
int p = can(i+kk);
if(p == 2) return (i + kk);
if(p == 1)
kk += i;
else break;
}
}
return kk;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |