제출 #828174

#제출 시각아이디문제언어결과실행 시간메모리
828174tolbi커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include <bits/stdc++.h>
using namespace std;
#include "prize.h"
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int find_best(int n) {
    int l = 0, r = n-1;
    while (l<r){
        int mid = l+(r-l)/2;
        vector<int> res = ask(mid);
        if (res[0]+res[1]==0) return mid;
        if (res[0]>0){
            r=mid;
        }
        else {
            l=mid+1;
        }
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...