| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1305323 | kaloyan | 커다란 상품 (IOI17_prize) | C++20 | 1 ms | 400 KiB |
#include "prize.h"
#include <cassert>
int f(int mid)
{
auto v = ask(mid);
return v[0] - v[1];
}
int find_best(int n)
{
int l = -1, r = n;
while(l + 1 < r)
{
int m = (l + r) / 2;
int res = f(m);
if(res == 0)
{
return m;
}
if(res < 0)
{
l = m;
}
else
{
r = m;
}
}
assert(l != -1);
return l;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
