제출 #1340275

#제출 시각아이디문제언어결과실행 시간메모리
1340275JuanJL커다란 상품 (IOI17_prize)C++20
0 / 100
0 ms424 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int find_best(int n) {
	ll i = 0;
	vector<int> ares = {-1,-1};
	while(i<n){
		vector<int> ires = ares;
		ires=ask(i);
		ll l = i; ll r=n-1;
		while(l<=r){
			ll mid=(l+r)/2;
			vector<int> res = ask(mid);
			ares=res;
			//cout<<res[1]<<" <-"<<mid<<'\n';
			if(res[1]!=ires[1]||res[1]+res[0]!=ires[1]+ires[0]) r=mid-1;
			else l=mid+1;
		}
		//cout<<i<<" ";
		i=r+1;
		//cout<<i-1<<'\n';
		//cout<<ares[0]<<"-"<<ares[1]<<'\n';
		if(ares[0]==0 && ares[1]==0) return i;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...