Submission #67677

# Submission time Handle Problem Language Result Execution time Memory
67677 2018-08-15T08:32:26 Z zscoder The Big Prize (IOI17_prize) C++17
95.24 / 100
85 ms 3052 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;
int totalquery;
const int MX = 10000;
ii query(int x)
{
	if(x<0||x>=n) return mp(0,0);
	if(dp[x].fi>=0) return dp[x];
	totalquery++; assert(totalquery<=MX);
	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]);
	assert(cntl.fi+cntl.se<=newmax);
	if(cntl.fi+cntl.se<newmax){global.pb(vec[l]); solve(l+1,r); return ;}
	ii cntr=query(vec[r]);
	assert(cntr.fi+cntr.se<=newmax);
	if(cntr.fi+cntr.se<newmax){global.pb(vec[r]); solve(l,r-1); return ;}
	ii tmp = query(vec[mid]);
	assert(tmp.fi+tmp.se<=newmax);
	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,mid);
	if(cntright) solve(mid,r);
}

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=0; int cr=int(vec.size());
		while(cr>1)
		{
			C+=int(sqrt(cr))+1; cr=int(sqrt(cr));
		}
		C=min(C,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);
		//cerr<<"TOTAL NUMBER OF QUERIES : "<<totalquery<<'\n';
		vec=global; sort(vec.begin(),vec.end()); vec.erase(unique(vec.begin(),vec.end()),vec.end());
		/*
		for(int x:vec)
		{
			cerr<<x<<' ';
		}
		cerr<<'\n';
		*/
	}
	return vec[0];
}
# Verdict Execution time Memory Grader output
1 Correct 13 ms 2796 KB Output is correct
2 Correct 8 ms 2796 KB Output is correct
3 Correct 13 ms 2908 KB Output is correct
4 Correct 11 ms 2908 KB Output is correct
5 Correct 9 ms 2916 KB Output is correct
6 Correct 7 ms 2936 KB Output is correct
7 Correct 11 ms 2976 KB Output is correct
8 Correct 9 ms 2988 KB Output is correct
9 Correct 10 ms 2992 KB Output is correct
10 Correct 10 ms 2992 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 2992 KB Output is correct
2 Correct 11 ms 2992 KB Output is correct
3 Correct 10 ms 2992 KB Output is correct
4 Correct 7 ms 2992 KB Output is correct
5 Correct 9 ms 2992 KB Output is correct
6 Correct 11 ms 2992 KB Output is correct
7 Correct 9 ms 2992 KB Output is correct
8 Correct 9 ms 2992 KB Output is correct
9 Correct 8 ms 2992 KB Output is correct
10 Correct 7 ms 2992 KB Output is correct
11 Correct 21 ms 2992 KB Output is correct
12 Correct 13 ms 2992 KB Output is correct
13 Correct 18 ms 2992 KB Output is correct
14 Correct 13 ms 2992 KB Output is correct
15 Partially correct 41 ms 2992 KB Partially correct - number of queries: 5170
16 Partially correct 35 ms 2992 KB Partially correct - number of queries: 5432
17 Partially correct 57 ms 2992 KB Partially correct - number of queries: 5392
18 Partially correct 45 ms 2992 KB Partially correct - number of queries: 5382
19 Partially correct 23 ms 2992 KB Partially correct - number of queries: 5093
20 Correct 36 ms 2992 KB Output is correct
21 Partially correct 43 ms 2992 KB Partially correct - number of queries: 5398
22 Correct 52 ms 2992 KB Output is correct
23 Correct 8 ms 2992 KB Output is correct
24 Correct 17 ms 2992 KB Output is correct
25 Partially correct 70 ms 2992 KB Partially correct - number of queries: 5029
26 Partially correct 51 ms 2992 KB Partially correct - number of queries: 5001
27 Correct 12 ms 2992 KB Output is correct
28 Correct 50 ms 2992 KB Output is correct
29 Correct 53 ms 3052 KB Output is correct
30 Partially correct 61 ms 3052 KB Partially correct - number of queries: 5356
31 Partially correct 27 ms 3052 KB Partially correct - number of queries: 5356
32 Correct 12 ms 3052 KB Output is correct
33 Correct 3 ms 3052 KB Output is correct
34 Partially correct 78 ms 3052 KB Partially correct - number of queries: 5394
35 Correct 18 ms 3052 KB Output is correct
36 Partially correct 81 ms 3052 KB Partially correct - number of queries: 5348
37 Correct 16 ms 3052 KB Output is correct
38 Correct 11 ms 3052 KB Output is correct
39 Partially correct 75 ms 3052 KB Partially correct - number of queries: 5353
40 Correct 65 ms 3052 KB Output is correct
41 Partially correct 54 ms 3052 KB Partially correct - number of queries: 5401
42 Partially correct 41 ms 3052 KB Partially correct - number of queries: 5401
43 Partially correct 32 ms 3052 KB Partially correct - number of queries: 5280
44 Partially correct 82 ms 3052 KB Partially correct - number of queries: 5407
45 Partially correct 49 ms 3052 KB Partially correct - number of queries: 5024
46 Partially correct 80 ms 3052 KB Partially correct - number of queries: 5384
47 Partially correct 70 ms 3052 KB Partially correct - number of queries: 5040
48 Partially correct 33 ms 3052 KB Partially correct - number of queries: 5370
49 Partially correct 78 ms 3052 KB Partially correct - number of queries: 5375
50 Partially correct 78 ms 3052 KB Partially correct - number of queries: 5404
51 Partially correct 38 ms 3052 KB Partially correct - number of queries: 5412
52 Partially correct 72 ms 3052 KB Partially correct - number of queries: 5428
53 Correct 10 ms 3052 KB Output is correct
54 Partially correct 68 ms 3052 KB Partially correct - number of queries: 5373
55 Partially correct 64 ms 3052 KB Partially correct - number of queries: 5405
56 Partially correct 49 ms 3052 KB Partially correct - number of queries: 5374
57 Partially correct 73 ms 3052 KB Partially correct - number of queries: 5385
58 Partially correct 68 ms 3052 KB Partially correct - number of queries: 5380
59 Partially correct 81 ms 3052 KB Partially correct - number of queries: 5387
60 Partially correct 85 ms 3052 KB Partially correct - number of queries: 5355
61 Correct 14 ms 3052 KB Output is correct
62 Correct 10 ms 3052 KB Output is correct
63 Correct 12 ms 3052 KB Output is correct
64 Correct 14 ms 3052 KB Output is correct
65 Correct 12 ms 3052 KB Output is correct
66 Correct 21 ms 3052 KB Output is correct
67 Correct 17 ms 3052 KB Output is correct
68 Correct 12 ms 3052 KB Output is correct
69 Correct 17 ms 3052 KB Output is correct
70 Correct 13 ms 3052 KB Output is correct
71 Partially correct 58 ms 3052 KB Partially correct - number of queries: 5239
72 Correct 13 ms 3052 KB Output is correct
73 Partially correct 52 ms 3052 KB Partially correct - number of queries: 5176
74 Partially correct 52 ms 3052 KB Partially correct - number of queries: 5203
75 Correct 12 ms 3052 KB Output is correct
76 Correct 27 ms 3052 KB Output is correct
77 Partially correct 52 ms 3052 KB Partially correct - number of queries: 5459
78 Correct 17 ms 3052 KB Output is correct
79 Correct 31 ms 3052 KB Output is correct
80 Partially correct 32 ms 3052 KB Partially correct - number of queries: 5476
81 Partially correct 69 ms 3052 KB Partially correct - number of queries: 5469
82 Partially correct 52 ms 3052 KB Partially correct - number of queries: 5454
83 Correct 9 ms 3052 KB Output is correct
84 Correct 57 ms 3052 KB Output is correct
85 Partially correct 68 ms 3052 KB Partially correct - number of queries: 5475
86 Correct 8 ms 3052 KB Output is correct
87 Correct 6 ms 3052 KB Output is correct
88 Correct 13 ms 3052 KB Output is correct
89 Correct 14 ms 3052 KB Output is correct
90 Correct 13 ms 3052 KB Output is correct
91 Correct 14 ms 3052 KB Output is correct
92 Correct 12 ms 3052 KB Output is correct
93 Correct 10 ms 3052 KB Output is correct
94 Correct 11 ms 3052 KB Output is correct
95 Correct 19 ms 3052 KB Output is correct
96 Correct 16 ms 3052 KB Output is correct
97 Correct 10 ms 3052 KB Output is correct