Submission #1029124

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029124		amirhoseinfar1385	커다란 상품 (IOI17_prize)	C++17	20 / 100	701 ms	1048576 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
map<int,pair<int,int>>mp;

pair<int,int>pors(int u){
	if(mp.count(u)==0){
		vector<int>hey=ask(u);
		mp[u]=make_pair(hey[0],hey[1]);
	}
	return mp[u];
}
int mainres=-1;

void solve(int l,int r){
	if(mainres!=-1){
		return ;
	}
	int mid=(l+r)>>1;
	pair<int,int>fake=pors(mid);
	if(fake.first==fake.second&&fake.first==0){
		mainres=mid;
		return ;
	}
	if(fake.second!=0){
		solve(mid+1,r);
	}
	if(fake.first!=0){
		solve(l,mid-1);
	}
}

int find_best(int n) {
	solve(0,n-1);
	return mainres;
}

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