Submission #292443

#	Time	Username	Problem	Language	Result	Execution time	Memory
292443		luciocf	커다란 상품 (IOI17_prize)	C++14	20 / 100	86 ms	256 KiB

prize

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

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;

pii get(int i)
{
	vector<int> v = ask(i);

	return {v[0], v[1]};
}

int find_best(int n)
{
	int ini = 0, fim = n-1;

	while (ini <= fim)
	{
		int mid = (ini+fim)>>1;

		if (get(mid).ff == 0 && get(mid).ss == 0) return mid;
		else if (get(mid).ff > 0) fim = mid-1;
		else ini = mid+1;
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

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