Submission #1362647

#TimeUsernameProblemLanguageResultExecution timeMemory
1362647maya_sThe Big Prize (IOI17_prize)C++20
0 / 100
17 ms568 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll, ll> pll;

ll ans = -1, info[200200];
pll query_answer[200200];

pll do_ask(ll x){
	if(!info[x]) {
		vector<ll> v = ask(x);
		query_answer[x] =  {v[0], v[1]};
		info[x] = 1;
	}
	return query_answer[x];
}

void rec(ll a, ll b, ll k, ll left, ll right, ll tot){
	if(a > b || k == 0 || ans != -1) return;
	ll mid = (a + b) / 2, i = mid;
	pll range = {mid, mid};
	auto[l, r] = do_ask(mid);
	if(a == b && (l + r) != 0) return;
	for(; i <= b && (l + r) < tot; i++) {
		auto[this_l, this_r] = do_ask(i);
		l = this_l, r = this_r;
		if(l + r == 0) {ans = i; return;}
	}
	ll cnt = i - mid;
	rec(a, mid-1, k - cnt, left, right + cnt, tot);
	rec(i+1, b, r - right, tot - (r - right) - right, right, tot);
}

int find_best(int n) {
	ll tot = 0;
	for(ll i = 0; i <= sqrt(n); i++){
		auto[x, y] = do_ask(i);
		if(x == 0 && y == 0) return i;
		tot = max(tot, (x + y));
	}
	rec(0, n-1, tot, 0, 0, tot);
	return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...