| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 125916 | chubyxdxd | 커다란 상품 (IOI17_prize) | C++11 | 2 ms | 508 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) {
vector<int> v;
int low=0;int hi=n,mid;
while(hi-low>1){
v.clear();
mid=(low+hi)/2;
v=ask(mid);
if(v[0]==0 and v[1]==0){
return mid;
break;
}
if(v[0]<v[1]){
low=mid;
}
else{
hi=mid;
}
}
return ((low+hi)/2);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
