Submission #56487

# Submission time Handle Problem Language Result Execution time Memory
56487 2018-07-11T13:05:06 Z Kerim The Big Prize (IOI17_prize) C++17
90 / 100
139 ms 572 KB
#include "bits/stdc++.h"
#include "prize.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
#define left cep
#define right sag
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<=b){a=b;return 1;}return 0;}
int n;
const int c=450;
//~ int arr[MAXN],query=0;
//~ int left[MAXN],right[MAXN],cnt[123];
//~ vector<int>ask(int x){
	//~ query++;
	//~ vector<int>res(2,0);
	//~ assert(res[0]+res[1]==0);
	//~ res[0]=left[x];
	//~ res[1]=right[x];
	//~ return res;	
//~ }
int find_best(int N){
	n=N;
	int mx=0,who;
	vector<int>res,tmp;
	for(int i=0;i<min(n,500);i++){
		res=ask(i);
		if(res[0]+res[1]==0)
			return i;
		if(umax(mx,res[0]+res[1]))
			who=i;
	}who++;
	while(who<n){
		tmp=ask(who);
		if(tmp[0]+tmp[1]==0)
			return who;
		if(tmp[0]+tmp[1]<mx){
			who++;
			continue;
		}	
		while(who+c<n and ask(who+c)==tmp)
			who+=c;
		int st=who+1,en=n-1,pos=who;
		while(st<=en){
			int mid=(st+en)/2;
			res=ask(mid);
			if(res!=tmp)
				en=mid-1;
			else{
				pos=mid;
				st=mid+1;
			}	
		}
		who=pos+1;
	}
	return -1;
}
//~ int main(){
    //~ freopen("file.in", "r", stdin);
    //~ int N;
    //~ scanf("%d",&N);
    //~ for(int i=0;i<N;i++)
		//~ scanf("%d",arr+i);
	//~ for(int i=0;i<N;i++){
		//~ for(int j=1;j<arr[i];j++)
			//~ left[i]+=cnt[j];
		//~ cnt[arr[i]]++;	
	//~ }	
	//~ memset(cnt,0,sizeof cnt);
	//~ for(int i=N-1;i>=0;i--){
		//~ for(int j=1;j<arr[i];j++)
			//~ right[i]+=cnt[j];
		//~ cnt[arr[i]]++;	
	//~ }
	//~ int ans=find_best(N);
	//~ assert(arr[ans]==1);
	//~ printf("%d\n",ans);	
	//~ debug(query);
	//~ return 0;
//~ }

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:45:6: warning: 'who' may be used uninitialized in this function [-Wmaybe-uninitialized]
  }who++;
   ~~~^~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 288 KB Output is correct
2 Correct 13 ms 336 KB Output is correct
3 Correct 12 ms 388 KB Output is correct
4 Correct 7 ms 408 KB Output is correct
5 Correct 6 ms 408 KB Output is correct
6 Correct 4 ms 536 KB Output is correct
7 Correct 6 ms 536 KB Output is correct
8 Correct 11 ms 552 KB Output is correct
9 Correct 8 ms 552 KB Output is correct
10 Correct 10 ms 552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 552 KB Output is correct
2 Correct 14 ms 552 KB Output is correct
3 Correct 12 ms 552 KB Output is correct
4 Correct 6 ms 552 KB Output is correct
5 Correct 6 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 6 ms 552 KB Output is correct
8 Correct 15 ms 552 KB Output is correct
9 Correct 11 ms 552 KB Output is correct
10 Correct 16 ms 552 KB Output is correct
11 Correct 16 ms 552 KB Output is correct
12 Correct 5 ms 552 KB Output is correct
13 Correct 27 ms 552 KB Output is correct
14 Correct 15 ms 556 KB Output is correct
15 Correct 12 ms 556 KB Output is correct
16 Partially correct 62 ms 556 KB Partially correct - number of queries: 8204
17 Correct 5 ms 556 KB Output is correct
18 Partially correct 110 ms 556 KB Partially correct - number of queries: 9561
19 Correct 4 ms 560 KB Output is correct
20 Correct 37 ms 560 KB Output is correct
21 Correct 34 ms 560 KB Output is correct
22 Correct 11 ms 560 KB Output is correct
23 Correct 8 ms 560 KB Output is correct
24 Correct 6 ms 560 KB Output is correct
25 Partially correct 39 ms 560 KB Partially correct - number of queries: 5711
26 Partially correct 58 ms 560 KB Partially correct - number of queries: 5632
27 Correct 6 ms 560 KB Output is correct
28 Partially correct 70 ms 560 KB Partially correct - number of queries: 9335
29 Partially correct 66 ms 560 KB Partially correct - number of queries: 7260
30 Partially correct 84 ms 560 KB Partially correct - number of queries: 9499
31 Correct 5 ms 560 KB Output is correct
32 Correct 11 ms 560 KB Output is correct
33 Correct 2 ms 560 KB Output is correct
34 Correct 29 ms 560 KB Output is correct
35 Correct 6 ms 560 KB Output is correct
36 Correct 19 ms 560 KB Output is correct
37 Correct 12 ms 560 KB Output is correct
38 Correct 6 ms 560 KB Output is correct
39 Correct 44 ms 560 KB Output is correct
40 Partially correct 97 ms 560 KB Partially correct - number of queries: 8561
41 Partially correct 29 ms 560 KB Partially correct - number of queries: 5897
42 Partially correct 30 ms 560 KB Partially correct - number of queries: 5897
43 Partially correct 39 ms 560 KB Partially correct - number of queries: 5370
44 Correct 35 ms 560 KB Output is correct
45 Correct 40 ms 560 KB Output is correct
46 Correct 5 ms 560 KB Output is correct
47 Correct 55 ms 560 KB Output is correct
48 Partially correct 80 ms 560 KB Partially correct - number of queries: 7181
49 Correct 20 ms 560 KB Output is correct
50 Partially correct 80 ms 560 KB Partially correct - number of queries: 9558
51 Correct 50 ms 560 KB Output is correct
52 Correct 8 ms 560 KB Output is correct
53 Correct 15 ms 560 KB Output is correct
54 Correct 31 ms 560 KB Output is correct
55 Correct 7 ms 560 KB Output is correct
56 Partially correct 74 ms 572 KB Partially correct - number of queries: 9560
57 Partially correct 56 ms 572 KB Partially correct - number of queries: 7098
58 Partially correct 89 ms 572 KB Partially correct - number of queries: 7210
59 Partially correct 63 ms 572 KB Partially correct - number of queries: 5897
60 Partially correct 35 ms 572 KB Partially correct - number of queries: 5508
61 Correct 24 ms 572 KB Output is correct
62 Correct 12 ms 572 KB Output is correct
63 Correct 7 ms 572 KB Output is correct
64 Correct 14 ms 572 KB Output is correct
65 Correct 19 ms 572 KB Output is correct
66 Correct 18 ms 572 KB Output is correct
67 Correct 17 ms 572 KB Output is correct
68 Correct 9 ms 572 KB Output is correct
69 Correct 22 ms 572 KB Output is correct
70 Correct 13 ms 572 KB Output is correct
71 Partially correct 82 ms 572 KB Partially correct - number of queries: 9900
72 Correct 17 ms 572 KB Output is correct
73 Partially correct 131 ms 572 KB Partially correct - number of queries: 9749
74 Partially correct 92 ms 572 KB Partially correct - number of queries: 9812
75 Correct 13 ms 572 KB Output is correct
76 Partially correct 55 ms 572 KB Partially correct - number of queries: 8533
77 Partially correct 115 ms 572 KB Partially correct - number of queries: 9742
78 Correct 16 ms 572 KB Output is correct
79 Correct 46 ms 572 KB Output is correct
80 Partially correct 139 ms 572 KB Partially correct - number of queries: 9730
81 Partially correct 116 ms 572 KB Partially correct - number of queries: 9728
82 Partially correct 63 ms 572 KB Partially correct - number of queries: 9648
83 Correct 16 ms 572 KB Output is correct
84 Partially correct 77 ms 572 KB Partially correct - number of queries: 8111
85 Partially correct 107 ms 572 KB Partially correct - number of queries: 9685
86 Correct 13 ms 572 KB Output is correct
87 Correct 6 ms 572 KB Output is correct
88 Correct 15 ms 572 KB Output is correct
89 Correct 11 ms 572 KB Output is correct
90 Correct 10 ms 572 KB Output is correct
91 Correct 20 ms 572 KB Output is correct
92 Correct 14 ms 572 KB Output is correct
93 Correct 13 ms 572 KB Output is correct
94 Correct 17 ms 572 KB Output is correct
95 Correct 14 ms 572 KB Output is correct
96 Correct 20 ms 572 KB Output is correct
97 Correct 6 ms 572 KB Output is correct