| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 549158 | cig32 | 커다란 상품 (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>
#include "prize.h"
using namespace std;
int find_best(int n) {
int lb = 0, rb = n - 1;
while(lb < rb) {
int mid = (lb + rb) >> 1;
vector<int> q = ask(mid);
if(q[0] == 0 && q[1] == 0) return mid;
if(q[0] == 0) lb = mid + 1;
else rb = mid;
}
return lb;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
