Submission #715948

#	Time	Username	Problem	Language	Result	Execution time	Memory
715948		myrcella	The Big Prize (IOI17_prize)	C++17	95.89 / 100	56 ms	428 KiB

prize

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "prize.h"
 
const int maxn = 2e5+10;

int ans;
set <int> pos;
vector <int> val;
int sum;
 
void solve(int l,int r,int pre,int suf) {
	if (l>r) return;
	int midl = l+r>>1;
	int midr = midl;
	vector <int> tmp = {-1,-1};
	int mid;
	while (midl>=l) {
		tmp = ask(midl);
		if (tmp[0]+tmp[1]==sum) break;
		if (tmp[0]+tmp[1]==0) {
			ans = midl;
			return;
		}
		pos.insert(midl);
		midl--;
	}
	if (midl<l) {
		midr++;
		while (midr<=r) {
			tmp = ask(midr);
			if (tmp[0]+tmp[1]==sum) break;
			if (tmp[0]+tmp[1]==0) {
				ans = midr;
				return;
			}
			pos.insert(midr);
			midr++;
		}
		mid=midr;
	}
	else mid=midl;
	if (mid>r) return;
	if (tmp[0]-pre>0) solve(l,midl-1,pre,tmp[1]);
	if (tmp[1]-suf>0) solve(midr+1,r,tmp[0],suf);
	return;
}
 
int find_best(int n) {
	rep(i,0,472) {
		vector <int> tmp = ask(i);
		if (tmp[0]+tmp[1]==0) return i;
		val.pb(tmp[0]+tmp[1]);
	}
	
	sort(ALL(val));val.erase(unique(ALL(val)),val.end());
	sum=val.back();
	solve(472,n-1,0,0);
	return ans;
}

Compilation message (stderr)

prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:34:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |  int midl = l+r>>1;
      |             ~^~

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