Submission #297106

#	Time	Username	Problem	Language	Result	Execution time	Memory
297106		Muhammetali	커다란 상품 (IOI17_prize)	C++11	20 / 100	80 ms	524 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
int find_best(int n)
{
	queue<pi>q;
	q.push({0,n-1});
	while(sz(q))
	{
		int l=q.ft.f;
		int r=q.ft.s;
		q.pop();
		int mid=(l+r)/2;
		vi res=ask(mid);
		if (res[0]==0 && res[1]==0)return mid;
		if (res[0]>0 && l<r)q.push({l,mid-1});
		if (res[1]>0 && l<r)q.push({mid+1,r});
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:28:11: warning: control reaches end of non-void function [-Wreturn-type]
   28 |  queue<pi>q;
      |           ^

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