제출 #96376

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

using namespace std;

typedef long long ll;

int ans,n;

void solve(int l,int r){
	if(l > r || ans != -1)return;
	int md = (l+r)/2;
	vector<int> res = ask(md);
	if(res[0] + res[1] == 0){
		ans = md;
		return;
	}
	bool go = rand() % 2;
	if(go){
		solve(l,md-1);
		solve(md+1,r);
	}else{
		solve(md+1,r);
		solve(l,md-1);
	}
}

int find_best(int N) {
	srand(time(0));
	n = N;
	ans = -1;
	solve(0,n-1);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...