# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38346 | MatheusLealV | The Big Prize (IOI17_prize) | C++14 | 0 ms | 2796 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>
#define N 200050
#include "prize.h"
using namespace std;
int n, v[N];
int find_best(int n)
{
int ini = 0, fim = n - 1, mid;
while(fim >= ini)
{
mid = (ini + fim)/2;
vector<int> aux = ask(mid);
if(aux[0] + aux[1] == 0) return mid;
if(aux[0]) fim = mid - 1;
else ini = mid + 1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |