제출 #937845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937845		Macker	커다란 상품 (IOI17_prize)	C++14	20 / 100	54 ms	596 KiB

prize

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

typedef long long ll;
#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)

using namespace std;

int find_best(int n) {
	int mn = 0;
	FOR(i, min(500, n)){
		auto res = ask(i);
		mn = max(mn, res[0] + res[1]);
	}
	vector<int> pos;
	int l = 0, r = 1;
	FOR(i, mn){
		while(1){
			auto ret = ask(r);
			if(ret[0] + ret[1] != mn) break;
			if(ret[0] > i) break;
			r += (r - l); 
			if(r >= n){
				r = n - 1;
				break;
			}
		}
		while(l < r){
			int mid = (l + r) / 2;
			auto ret = ask(mid);
			if(ret[0] + ret[1] != mn) r = mid;
			else if(ret[0] > i) r = mid - 1;
			else l = mid + 1;
		}
		pos.push_back(l);
		if(r != n - 1) r++;
	}
	for (auto i : pos) {
		auto ret = ask(i);
		if(ret[0] + ret[1] == 0) return i;
	}
	return 0;
}

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