Submission #647429

#TimeUsernameProblemLanguageResultExecution timeMemory
647429IwanttobreakfreeThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include "prize.h"
#include <vector>
#include <iostream>

using namespace std;

int find_best(int n) {
	int l = 0, r = n-1;
    while (l <= r) {
        int mid = (r+l)/2;
        vector<int> res = ask (mid);
        if (res[0] < res[1]) l = mid+1;
        else if (res[0] == res[1]) return mid;
        else r = mid-1;
    }
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...