Submission #1223369

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223369		Malix	The Big Prize (IOI17_prize)	C++20	20 / 100	0 ms	408 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int BS(int l,int r){
	if(l==r)return l;
	int m=(l+r)/2;
	vi a=ask(m);
	if(a[0]==0&&a[1]==0)return m;
	if(a[0]==1)return BS(l,m-1);
	else return BS(m+1,r);
}

int find_best(int n) {
	return BS(0,n-1);
}

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