| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 117269 | WongHokFong_cpp | 커다란 상품 (IOI17_prize) | C++14 | 116 ms | 432 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 <iostream>
#include "prize.h"
#include <vector>
using namespace std;
vector <int> res;
int find_best(int n)
{
int l=0,r=n-1;
do
{
int mid=(l+r)/2;
res=ask(mid);
if (res[0]>0) r=mid;
else if (res[1]>0) l=mid;
else return mid;
}
while (l<r);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
