# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1195858 | DeathIsAwe | 커다란 상품 (IOI17_prize) | C++20 | 0 ms | 412 KiB |
#include "prize.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
using namespace std;
int find_best(int n) {
vector<int> result;
int left = 0, right = n - 1, middle;
result = ask(0);
if (result[0] + result[1] == 0) return 0;
result = ask(n - 1);
if (result[0] + result[1] == 0) return n - 1;
while (left + 1 < right) {
middle = (left + right) / 2;
result = ask(middle);
if (result[0] + result[1] == 0) return middle;
if (result[0] == 1) right = middle;
else left = middle;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |