Submission #1080368

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080368		TB_	커다란 상품 (IOI17_prize)	C++17	20 / 100	1 ms	596 KiB

prize

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define F first
#define S second
#define pb push_back
#define deb(x) cout << #x << " = " << (x) << endl
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl

typedef vector<ll> vl;
typedef vector<vl> vvl;

int find_best(int n);
std::vector<int> ask(int i);

int find_best(int n){

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

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