Submission #333182

#	Time	Username	Problem	Language	Result	Execution time	Memory
333182		mohamedsobhi777	커다란 상품 (IOI17_prize)	C++14	20 / 100	91 ms	492 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n)
{
	for (int i = 0; i < n; ++i)
	{
		int j = i;
		vector<int> v = ask(i);
		if (v[0] == 0 && v[1] == 0)
			return i;
		int lo = i, hi = n - 1;
		while (lo <= hi)
		{
			int mid = (lo + hi) >> 1;
			vector<int> q = ask(mid);
			if (q == v)
				j = mid,
				lo = mid + 1;
			else
				hi = mid - 1;
		}
		i = j;
	}
	assert(0);
}

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