제출 #227377

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

prize

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include "prize.h"
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll)a; i<(ll)b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 100000000000000000LL
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int find_best(int n) 
{
	ll N=(ll) (n);
    ll lo=0LL; ll hi=N-1;
    while(hi>lo)
    {
        ll mid=(lo+hi)/2LL;
        vector<int> q=ask(mid);
        if(q[0]==0 && q[1]==0) {return ((int) mid);}
        if(q[0]==1) {hi=mid-1;}
        else {lo=mid+1;}
    }
    return ((int) lo);
}

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