Submission #46875

# Submission time Handle Problem Language Result Execution time Memory
46875 2018-04-24T10:32:24 Z Kerim The Big Prize (IOI17_prize) C++17
90 / 100
57 ms 572 KB
#include "bits/stdc++.h"
#include "prize.h"
#define MAXN 100009
#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;
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;}
//~ vector<int>arr;
//~ int cnt=0;
//~ vector<int>ask(int x){
	//~ int a=0,b=0;
	//~ for(int i=0;i<x;i++)
		//~ a+=(arr[x]>arr[i]);
	//~ for(int i=x+1;i<(int)arr.size();i++)
		//~ b+=(arr[x]>arr[i]);
	//~ vector<int>v;v.pb(a);v.pb(b);	
	//~ cnt++;
	//~ return v;
//~ }
const int C=1000;
int find_best(int n){
	int mx=0;
	for(int i=0;i<n;i++){
		vector<int>res=ask(i);
		if(res[0]+res[1]==0)
			return i;
		umax(mx,res[0]+res[1]);
		if(res[0]+res[1]<mx)
			continue;
		if(i+C<n and ask(i+C)==res){
			i+=C;
			continue;
		}
		int st=i+1,en=min(n-1,i+C);
		while(st<=en){
			int mid=(st+en)>>1;
			if(ask(mid)==res){
				i=mid;
				st=mid+1;
			}
			else
				en=mid-1;
		}	
	}
	return -1;
}
//~ int main(){
    //~ freopen("file.in", "r", stdin);
    //~ int n;
    //~ scanf("%d",&n);
    //~ for(int i=0;i<n;i++){
		//~ int x;
		//~ scanf("%d",&x);
		//~ arr.pb(x);
	//~ }
	//~ for(int i=0;i<n;i++)
		//~ if(arr[i]==1){
			//~ if(find_best(n)==i)
				//~ puts("ok");
			//~ else
				//~ puts("wa");
			//~ debug(cnt);	
			//~ return 0;
		//~ }
	//~ return 0;
//~ }
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 4 ms 312 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 4 ms 556 KB Output is correct
10 Correct 6 ms 556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 556 KB Output is correct
2 Correct 3 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 4 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 4 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 3 ms 560 KB Output is correct
10 Correct 4 ms 560 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Correct 7 ms 560 KB Output is correct
14 Correct 5 ms 560 KB Output is correct
15 Correct 11 ms 560 KB Output is correct
16 Partially correct 39 ms 560 KB Partially correct - number of queries: 5083
17 Correct 2 ms 560 KB Output is correct
18 Partially correct 57 ms 560 KB Partially correct - number of queries: 6135
19 Correct 3 ms 560 KB Output is correct
20 Correct 20 ms 560 KB Output is correct
21 Correct 17 ms 560 KB Output is correct
22 Correct 5 ms 560 KB Output is correct
23 Correct 2 ms 560 KB Output is correct
24 Correct 2 ms 572 KB Output is correct
25 Correct 35 ms 572 KB Output is correct
26 Correct 21 ms 572 KB Output is correct
27 Correct 3 ms 572 KB Output is correct
28 Partially correct 49 ms 572 KB Partially correct - number of queries: 5867
29 Correct 37 ms 572 KB Output is correct
30 Partially correct 48 ms 572 KB Partially correct - number of queries: 6083
31 Correct 2 ms 572 KB Output is correct
32 Correct 17 ms 572 KB Output is correct
33 Correct 2 ms 572 KB Output is correct
34 Correct 22 ms 572 KB Output is correct
35 Correct 5 ms 572 KB Output is correct
36 Correct 11 ms 572 KB Output is correct
37 Correct 3 ms 572 KB Output is correct
38 Correct 2 ms 572 KB Output is correct
39 Correct 22 ms 572 KB Output is correct
40 Partially correct 39 ms 572 KB Partially correct - number of queries: 5197
41 Correct 24 ms 572 KB Output is correct
42 Correct 17 ms 572 KB Output is correct
43 Correct 31 ms 572 KB Output is correct
44 Correct 19 ms 572 KB Output is correct
45 Correct 18 ms 572 KB Output is correct
46 Correct 2 ms 572 KB Output is correct
47 Correct 23 ms 572 KB Output is correct
48 Correct 19 ms 572 KB Output is correct
49 Correct 4 ms 572 KB Output is correct
50 Partially correct 53 ms 572 KB Partially correct - number of queries: 6135
51 Correct 11 ms 572 KB Output is correct
52 Correct 2 ms 572 KB Output is correct
53 Correct 5 ms 572 KB Output is correct
54 Correct 26 ms 572 KB Output is correct
55 Correct 2 ms 572 KB Output is correct
56 Partially correct 28 ms 572 KB Partially correct - number of queries: 6135
57 Correct 19 ms 572 KB Output is correct
58 Correct 29 ms 572 KB Output is correct
59 Correct 17 ms 572 KB Output is correct
60 Correct 31 ms 572 KB Output is correct
61 Correct 6 ms 572 KB Output is correct
62 Correct 3 ms 572 KB Output is correct
63 Correct 10 ms 572 KB Output is correct
64 Correct 4 ms 572 KB Output is correct
65 Correct 5 ms 572 KB Output is correct
66 Correct 11 ms 572 KB Output is correct
67 Correct 5 ms 572 KB Output is correct
68 Correct 2 ms 572 KB Output is correct
69 Correct 7 ms 572 KB Output is correct
70 Correct 3 ms 572 KB Output is correct
71 Partially correct 53 ms 572 KB Partially correct - number of queries: 6130
72 Correct 6 ms 572 KB Output is correct
73 Partially correct 50 ms 572 KB Partially correct - number of queries: 6039
74 Partially correct 52 ms 572 KB Partially correct - number of queries: 6078
75 Correct 4 ms 572 KB Output is correct
76 Partially correct 49 ms 572 KB Partially correct - number of queries: 5197
77 Partially correct 57 ms 572 KB Partially correct - number of queries: 6133
78 Correct 6 ms 572 KB Output is correct
79 Correct 22 ms 572 KB Output is correct
80 Partially correct 41 ms 572 KB Partially correct - number of queries: 6134
81 Partially correct 52 ms 572 KB Partially correct - number of queries: 6135
82 Partially correct 42 ms 572 KB Partially correct - number of queries: 6083
83 Correct 5 ms 572 KB Output is correct
84 Correct 43 ms 572 KB Output is correct
85 Partially correct 46 ms 572 KB Partially correct - number of queries: 6135
86 Correct 10 ms 572 KB Output is correct
87 Correct 4 ms 572 KB Output is correct
88 Correct 11 ms 572 KB Output is correct
89 Correct 8 ms 572 KB Output is correct
90 Correct 4 ms 572 KB Output is correct
91 Correct 4 ms 572 KB Output is correct
92 Correct 5 ms 572 KB Output is correct
93 Correct 6 ms 572 KB Output is correct
94 Correct 5 ms 572 KB Output is correct
95 Correct 8 ms 572 KB Output is correct
96 Correct 5 ms 572 KB Output is correct
97 Correct 4 ms 572 KB Output is correct