oj.uz

Submission #67641

# Submission time Handle Problem Language Result Execution time Memory
67641 2018-08-15T07:26:40 Z zscoder The Big Prize (IOI17_prize) C++17
20 / 100
 107 ms 3044 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

ii dp[442311];
int n;

ii query(int x)
{
	if(x<0||x>=n) return mp(0,0);
	if(dp[x].fi>=0) return dp[x];
	vector<int> a = ask(x);
	dp[x].fi=a[0]; dp[x].se=a[1]; return dp[x];
}

vi global;
vector<int> vec;
int newmax;

void solve(int l, int r)
{
	if(l>r) return ;
	//later optimize by using count 
	int mid=(l+r)>>1;
	ii cntl=query(vec[l]);
	if(cntl.fi+cntl.se<newmax){global.pb(vec[l]); solve(l+1,r); return ;}
	ii cntr=query(vec[r]);
	if(cntr.fi+cntr.se<newmax){global.pb(vec[r]); solve(l,r-1); return ;}
	ii tmp = query(vec[mid]);
	if(tmp.fi+tmp.se<newmax)
	{
		global.pb(vec[mid]);
		solve(l,mid-1); solve(mid+1,r);
		return ;
	}
	int cntleft = tmp.fi-cntl.fi;
	int cntright = tmp.se-cntr.se;
	if(cntleft) solve(l+1,mid-1);
	if(cntright) solve(mid+1,r-1);
}

int find_best(int _n) 
{
	n=_n;
	for(int i=0;i<n;i++) {dp[i]=mp(-1,-1);vec.pb(i);}
	while(vec.size()>1)
	{
		global.clear(); int C=min(int((sqrt(int(vec.size())))) + 10,int(vec.size()));
		newmax=0;
		for(int i=0;i<C;i++) 
		{
			//cerr<<"QUERY : "<<query(vec[i]).fi<<' '<<query(vec[i]).se<<'\n';
			newmax=max(newmax,query(vec[i]).fi+query(vec[i]).se);
		}
		//cerr<<"NEWMAX : "<<newmax<<'\n';
		solve(0,int(vec.size())-1);
		vec=global; sort(vec.begin(),vec.end());
		//for(int x:vec) cerr<<x<<' ';
		//cerr<<'\n';
	}
	return vec[0];
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2716 KB Output is correct
2 Correct 7 ms 2860 KB Output is correct
3 Correct 7 ms 2860 KB Output is correct
4 Correct 13 ms 2860 KB Output is correct
5 Correct 9 ms 2860 KB Output is correct
6 Correct 9 ms 2860 KB Output is correct
7 Correct 11 ms 2860 KB Output is correct
8 Correct 13 ms 2964 KB Output is correct
9 Correct 10 ms 2964 KB Output is correct
10 Correct 13 ms 3044 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3044 KB Output is correct
2 Correct 11 ms 3044 KB Output is correct
3 Correct 10 ms 3044 KB Output is correct
4 Correct 13 ms 3044 KB Output is correct
5 Correct 8 ms 3044 KB Output is correct
6 Correct 10 ms 3044 KB Output is correct
7 Correct 11 ms 3044 KB Output is correct
8 Correct 9 ms 3044 KB Output is correct
9 Correct 11 ms 3044 KB Output is correct
10 Correct 9 ms 3044 KB Output is correct
11 Correct 24 ms 3044 KB Output is correct
12 Correct 26 ms 3044 KB Output is correct
13 Correct 27 ms 3044 KB Output is correct
14 Correct 19 ms 3044 KB Output is correct
15 Incorrect 107 ms 3044 KB Incorrect
16 Halted 0 ms 0 KB -