| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1060824 | ArthuroWich | 커다란 상품 (IOI17_prize) | C++17 | 56 ms | 344 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] == res[1] && res[0] == 0) {
return m;
} else if (res[0] < res[1]) {
l = m;
} else if (res[0] > res[1]) {
r = m-1;
}
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
