제출 #428688

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

prize

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define endl '\n'
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
const int N = 3e5+1;
const ll INF = 2e18;
const int MOD = 1e9+7;

vector<int> ask(int i);

int find_best(int n) {
    int l = 0,r = n-1;
    int ans = -1;

    while(l<=r){
        int mid = (l+r)/2;
        vector<int> arr = ask(mid);
        assert(arr[0]+arr[1] <= 1);
        if(arr[0] == 1)
            r = mid-1;
        else if(arr[1] == 1)
            l = mid+1;
        else{
            ans = mid;
            break;
        }
    }
    return ans;
}

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