제출 #500316

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500316		MohamedFaresNebili	커다란 상품 (IOI17_prize)	C++14	0 / 100	1 ms	284 KiB

prize

#include <bits/stdc++.h>
#include "prize.h"

        using namespace std;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<ll>;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) x.begin(), x.end()
        #define lb lower_bound
        #define ub upper_bound

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

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