Submission #757736

#TimeUsernameProblemLanguageResultExecution timeMemory
757736borisAngelovThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include "prize.h"

#include <iostream>
#include <vector>

using namespace std;

int find_best(int n)
{
    int l = 0;
    int r = n - 1;

    while (l <= r)
    {
        int mid = (l + r) / 2;

        vector<int> result = ask(mid);

        int l_ans = result[0];
        int r_ans = result[1];

        if (l_ans == 0 && r_ans == 0)
        {
            return mid;
        }

        if (l_ans == 1)
        {
            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...