Submission #297127

#	Time	Username	Problem	Language	Result	Execution time	Memory
297127		Muhammetali	The Big Prize (IOI17_prize)	C++11	0 / 100	1 ms	256 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;
		int jem=q.ft.f-q.ft.s+1;
		jem/=4;
		l+=jem;r+=jem;
		vi v1=ask(l);
		vi v2=ask(r);
		if (v1[0]==0 && v1[1]==0)return l;
		if (v2[0]==0 && v2[1]==0)return r;
		if (v1[0]-v2[0]==0)
		{
			q.push({q.ft.f,l-1});
			q.push({r+1,q.ft.s});
		}
	}
}

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: 0 / 20
• Subtask 2: 0 / 80