# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290076 | SamAnd | The Big Prize (IOI17_prize) | C++17 | 119 ms | 384 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;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
int find_best(int n)
{
int l = 0, r = n - 1;
while (l <= r)
{
int m = (l + r) / 2;
vector<int> v = ask(m);
if (v[0])
r = m - 1;
else if (v[1])
l = m + 1;
else
return m;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |