# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469009 | Cross_Ratio | The Big Prize (IOI17_prize) | C++14 | 90 ms | 328 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 "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int N) {
int s = 0;
int e = N;
srand(0);
int cnt = 0;
while(s + 1 != e) {
int mid = rand() % (e - s) + s;
vector<int> V = ask(mid);
if(V[0] == 0 && V[1] == 0) return mid;
else if(V[0] == 0) s = mid;
else if(V[1] == 0) e = mid;
cnt++;
assert(cnt < 10000);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |