Submission #69464

#	Time	Username	Problem	Language	Result	Execution time	Memory
69464		Diuven	The Big Prize (IOI17_prize)	C++14	94.79 / 100	73 ms	2392 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int MX=200010;

bool up[MX];
int L[MX], R[MX], sum, n;

void my_ask(int i){
	static set<int> S;
	if(S.find(i)!=S.end()) return;
	S.insert(i);
	vi now=ask(i);
	L[i]=now[0], R[i]=now[1];
}

int search(int s, int e, int l, int r){
	if(s>e) return 0;

	int m=(s+e)/2, ans=0;

	for(int i=m; i<=e; i++){
		my_ask(i);
		if(L[i]+R[i]==0) return i;
		if(L[i]+R[i]==sum){
			if(l<L[i]) ans+=search(s,i-1,l,R[i]);
			break;
		}
	}
	for(int i=m; i>=s; i--){
		my_ask(i);
		if(L[i]+R[i]==0) return i;
		if(L[i]+R[i]==sum){
			if(r<R[i]) ans+=search(i+1,e,L[i],r);
			break;
		}
	}
	return ans;
}

void get(){
	for(int i=0; i<min(500, n); i++){
		my_ask(i);
		sum=max(sum, L[i]+R[i]);
	}
}

int find_best(int _n){
	n=_n;
	get();
	return search(0,n-1,0,0);
}

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