제출 #1163681

#제출 시각아이디문제언어결과실행 시간메모리
1163681cnn008커다란 상품 (IOI17_prize)C++20
20 / 100
227 ms764 KiB
#include "prize.h"
#include "bits/stdc++.h"
using namespace std;

pair <int,int> mp[200005];
pair <int,int> get(int i){
	if(mp[i].first || mp[i].second) return mp[i];
	auto vi=ask(i);
	pair <int,int> ans={vi[0],vi[1]};
	return mp[i]=ans;
}
int find_best(int n) {
	int L=0,R=n-1;
	for(int i=0; i<=10000; i++){
		cerr<<i<<endl;
		int l=L,r=R,ans=-1;
		cerr<<"range : "<<L<<" "<<R<<endl;
		while(l<=r){
			int mid=(l+r)>>1;
			auto [u,v]=get(mid);
			if(!u and !v) return mid;
			cerr<<mid<<" "<<u<<" "<<v<<endl;
			if(!u){
				ans=mid+1;
				break;	
			}else{
				if(u<=i and (u+v)!=1){
					l=mid+1;
				}else{
					r=mid-1;
				}
			}
		}
		L=ans;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...