Submission #103205

#	Time	Username	Problem	Language	Result	Execution time	Memory
103205		baluteshih	The Big Prize (IOI17_prize)	C++14	100 / 100	53 ms	2080 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cerr << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

pii arr[200005];
map<int,set<int>> lmp,rmp;
pii query(int x)
{
	if(~arr[x].F) return arr[x];
	auto v=ask(x);
	return arr[x]=MP(v[0],v[1]);
}

void insl(int a)
{
	pii t=query(a);
	auto p=lmp[t.F+t.S].upper_bound(a);
	if(p!=lmp[t.F+t.S].end()&&query(*p)==t) 
		lmp[t.F+t.S].erase(p);
	if(p!=lmp[t.F+t.S].begin()&&query(*(--p))==t)
		return;
	lmp[t.F+t.S].insert(a);
}

void insr(int a)
{
	pii t=query(a);
	auto p=rmp[t.F+t.S].lower_bound(a);
	if(p!=rmp[t.F+t.S].end()&&query(*p)==t) 
		return;
	if(p!=rmp[t.F+t.S].begin()&&query(*(--p))==t)
		rmp[t.F+t.S].erase(p);
	rmp[t.F+t.S].insert(a);
}

int search(int l,int r)
{
	if(r-l<=1) return -1;
	int m=l+r>>1;
	pii a=query(l),b=query(r),t=query(m);
	if(t==MP(0,0)) return m;
	auto p=lmp[t.F+t.S].lower_bound(m);
	if(p!=lmp[t.F+t.S].begin())
	{
		--p;
		if(query(*p)==t&&*p<=l) return search(m,r);
	}
	p=rmp[t.F+t.S].upper_bound(m);
	if(p!=rmp[t.F+t.S].end())
	{
		if(query(*p)==t&&*p>=r) return search(l,m);
	}
	insl(m),insr(m);
	if(t==a||!t.F) return search(m,r);
	if(t==b||!t.S) return search(l,m);
	int df=search(l,m);
	if(~df) return df;
	return search(m,r);
}

int find_best(int n) 
{
	fill(arr,arr+n,MP(-1,-1));
	if(query(0)==MP(0,0)) return 0;
	if(query(n-1)==MP(0,0)) return n-1;
	insl(0),insr(n-1);
	return search(0,n-1);
}

Compilation message (stderr)

prize.cpp: In function 'int search(int, int)':
prize.cpp:51:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m=l+r>>1;
        ~^~

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