| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 297901 | Autoratch | 커다란 상품 (IOI17_prize) | C++14 | 1 ms | 384 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 l = 0,r = n-1;
while(l<r)
{
int m = (l+r)/2;
vector<int> res = ask(m);
if(res[0]) r = m-1;
else if(res[1]) l = m+1;
else return m;
}
return l;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
