Submission #1352040

#TimeUsernameProblemLanguageResultExecution timeMemory
1352040KALARRYThe Big Prize (IOI17_prize)C++20
0 / 100
17 ms416 KiB
//chockolateman

#include<bits/stdc++.h>
#include "prize.h"

using namespace std;

int search(int start,int end)
{
    if(start > end)
        return -1;
    int mid = (start + end)/2;
    vector<int> temp = ask(mid);
    if(temp[0]==0 && temp[1]==0)
        return mid;
    return max(search(start,mid-1),search(mid+1,end));
}

int find_best(int n) {
	return search(0,n-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...