제출 #347529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
347529		amunduzbaev	커다란 상품 (IOI17_prize)	C++14	20 / 100	1 ms	492 KiB

prize

/** made by amunduzbaev **/

#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Pi acos(-1);
#define mod 1e9+7
#define inf 1e18

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef pair<ll, ll> pll; 
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int NN = 2e3+5;

#include "prize.h"

int find_best(int n) {
	int l = 0, r = n-1;
	while(l < r){
		int m = (l + r +1)>>1;
		vii tmp = ask(m);
		if(tmp[0]) r = m-1;
		else l = m;
	}
	return l;
}

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