제출 #1344302

#제출 시각아이디문제언어결과실행 시간메모리
1344302MunkhErdene커다란 상품 (IOI17_prize)C++17
90 / 100
23 ms412 KiB
#include "prize.h"

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define _ << " " <<
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ull unsigned long long
#define lll __int128
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define BlueCrowner ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)

const ll NAIM = 1e18;

int find_best(int n) {
	ll cur = 0;
	FOR(i, 0, min(500, n)) {
		vector<int> a = ask(i);
		if(a[0] + a[1] > cur) {
			cur = a[0] + a[1];
		}
	}
	ll orig_cur = cur;
	ll L = 0;
	ll mn = NAIM, pos;
	while(mn){
		ll l = L, r = n - 1;
		vector<int> a = ask(L);
		if(a[0] + a[1] == orig_cur) {
			cur = a[1];
		}
		ll p = n - 1;
		while(l <= r) {
			ll m = (l + r) >> 1;
			vector<int> a = ask(m);
			if(a[0] + a[1] < mn) {
				mn = a[0] + a[1];
				pos = m;
			}
			if(a[1] < cur) {
				p = m;
				r = m - 1;
			}
			else l = m + 1;
		}

		L = p + 1;
	};
	return pos;
	

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...