Submission #1305320

#TimeUsernameProblemLanguageResultExecution timeMemory
1305320kaloyanThe Big Prize (IOI17_prize)C++20
20 / 100
1 ms400 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 = 0, 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;
        } 
    }

    return l;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...