Submission #379070

#	Time	Username	Problem	Language	Result	Execution time	Memory
379070		blue	The Big Prize (IOI17_prize)	C++17	20 / 100	1 ms	492 KiB

prize

#include "prize.h"
#include <vector>
using namespace std;

int diamond_search(int a, int b)
{
    if(a == b) return a;
    int m = (a+b)/2;

    vector<int> X = ask(m);

    if(X[0] == 0 && X[1] == 0) return m;
    else if(X[0] == 1) return diamond_search(a, m-1);
    else return diamond_search(m+1, b);
}

int find_best(int n)
{
    return diamond_search(1, n);
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80