Submission #1324986

#TimeUsernameProblemLanguageResultExecution timeMemory
1324986QuocSensei커다란 상품 (IOI17_prize)C++20
0 / 100
1 ms408 KiB
#include <bits/stdc++.h>

#define ll long long 
#define el cout << '\n'

using namespace std;

array<int, 2> ask(int i);

int find_best(int n)
{
    int l = 0;
    int r = n - 1;
    while (1)
    {
        int m = l + r >> 1;
        array<int, 2> X = ask(m);
        if (X[0] == 0 && X[1] == 0)
        {
            l = m;
            break;
        }
        if (X[0] == 0)
            l = m;
        else
            r = m;
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...