제출 #626511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626511		Mounir	커다란 상품 (IOI17_prize)	C++14	0 / 100	3062 ms	292 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

map<int, vector<int>> ans;

vector<int> ask_res(int i){
	if (ans.count(i)) return ans[i];
	ans[i] =  ask(i);
	//if (i != 7) cout << "query " << i << " " << rep[0] << " " << rep[1] <<  endl;
	return ans[i];
}

int find_best(int n) {
	int deb = 0, fin = n - 1;
	while (true){
		int mid = (deb + fin)/2;
		vector<int> resMid = ask_res(mid);
		if (resMid[0] + resMid[1] == 0)
			return mid;
		
		if (resMid[0] != mid)
			fin = mid - 1;
		else 
			deb = mid + 1;
	}
}

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