제출 #426752

#제출 시각아이디문제언어결과실행 시간메모리
426752A_D커다란 상품 (IOI17_prize)C++14
20 / 100
1 ms284 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
    int l=0,r=n-1;
    while(l<=r){
        int mid=(l+r)/2;
        vector<int> vec=ask(mid);
//        cout<<mid<<" "<<vec[0]<<" "<<vec[1]<<endl;
        if(vec[0]==vec[1])return mid;
        if(vec[0]){
            r=mid-1;
        }
        else l=mid+1;
    }
    assert(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...