| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 828174 | tolbi | The Big Prize (IOI17_prize) | C++17 | 1 ms | 336 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 <bits/stdc++.h>
using namespace std;
#include "prize.h"
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int find_best(int n) {
int l = 0, r = n-1;
while (l<r){
int mid = l+(r-l)/2;
vector<int> res = ask(mid);
if (res[0]+res[1]==0) return mid;
if (res[0]>0){
r=mid;
}
else {
l=mid+1;
}
}
return l;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
