제출 #1340298

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

#define forn(i,a,b) for(int i = a; i<b; i++)

using namespace std;
typedef long long ll;

ll cnt = 0;
vector<int> aask(int i ){
	cnt++;
/*	while(cnt>9990){
		exit(0);
	}*/
	
	//cout<<cnt<<'\n';
	return ask(i);
}

int find_best(int n) {
	ll i = 0;
	vector<int> ares = {-1,-1};
	vector<int> last = {-1,-1};
	forn(i,0,min(500,n)){
		vector<int> res = aask(i);
		if(res[0]+res[1]>last[0]+last[1]) last=res;
	}
	
	ll rng = 0;
	while(i<n){
		rng++;
		vector<int> ires = ares;
		ires=aask(i);
		if(ires[0]==0 && ires[1]==0) return i;
		if(ires[0]+ires[1]!=last[0]+last[1]){
			i++;
			continue;
		}
		
		ll l = i; ll r=n-1;
		while(l<=r){
			ll mid=(l+r)/2;
			vector<int> res = aask(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;
		}
		
		i=r+1;
	
		
		if(ares[0]==0 && ares[1]==0) return i;
		//cout<<"rango "<<rng<<'\n';
	}
	while(true){
		cout<<"salio\n";
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...