제출 #796990

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

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

int find_best(int n) {
	int l = 0, r = n-1;
    while (l < r) {
        int mid = (l+r)/2;
        vector<int> a = ask(mid);
        if (a[0] == 1) r = mid;
        else if (a[1] == 1) l = mid+1;
        else return mid;
    }
	return l;
}

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