Submission #434289

#	Time	Username	Problem	Language	Result	Execution time	Memory
434289		Monchito	커다란 상품 (IOI17_prize)	C++14	20 / 100	1 ms	328 KiB

prize

#include "prize.h"
using namespace std;

int bs(int n) {
    int l = 0, r = n-1, mid, ans=-1;

    while(r >= l) {
        mid = l + (r-l)/2;
        vector<int> a = ask(mid);

        if(a[0] == 0 && a[1] == 0) { ans = mid; break; }

        if(a[0] == 1) r = mid-1;
        else l = mid+1;
    }

    return ans;
}

int find_best(int n) {
	return bs(n);
}

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