Submission #137805

# Submission time Handle Problem Language Result Execution time Memory
137805 2019-07-28T09:49:18 Z ckodser The Big Prize (IOI17_prize) C++14
100 / 100
57 ms 5232 KB
#include "prize.h"
#include<bits/stdc++.h>

#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=2e5+500;
const ll inf=1e9+900;

vector<ll>  ansS[maxn];
ll mx=0;
vector<ll>  ASK(ll x){
    if(ansS[x].size())return ansS[x];
    ansS[x]=ask(x);
    mx=max(mx,ansS[x][0]+ansS[x][1]);
    return ansS[x];
}
ll N;
ll bild(ll l,ll r,ll L,ll R){
    l=max(l,0);
    r=min(r,N);
    if(l>=r)return -1;
    if(L+R==mx)return -1;
    ll mid=(l+r)/2;
    for(ll i=mid;i<r;i++){
	vector<ll> vec=ASK(i);
	if(vec[0]+vec[1]==mx){
	    ll XX=bild(l,mid,L,vec[1]+(mid-i)); 
	    if(XX!=-1)return XX;
	    XX=bild(i+1,r,vec[0],R);
	    if(XX!=-1)return XX;
	    return -1;
	}else{
	    if(vec[0]+vec[1]==0)return i;
	}
    }
    return bild(l,mid,L,R+(r-mid));
}

int find_best(int n) {
    N=n;
    if(n<=5000){
	for(ll i=0;i<n;i++){
	    vector<ll> vec=ask(i);
	    if(vec[0]+vec[1]==0)return i;
	}
    }
    for(ll i=0;i<50;i++){
	vector<ll> ans=ASK(i);
	if(ans[0]+ans[1]==0)return i;
    }
    return bild(0,n,0,0);
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5032 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5012 KB Output is correct
3 Correct 7 ms 5028 KB Output is correct
4 Correct 6 ms 5024 KB Output is correct
5 Correct 7 ms 4904 KB Output is correct
6 Correct 6 ms 5012 KB Output is correct
7 Correct 7 ms 5096 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 5020 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 10 ms 4904 KB Output is correct
12 Correct 7 ms 4928 KB Output is correct
13 Correct 9 ms 5032 KB Output is correct
14 Correct 7 ms 4988 KB Output is correct
15 Correct 10 ms 5136 KB Output is correct
16 Correct 42 ms 5112 KB Output is correct
17 Correct 7 ms 4904 KB Output is correct
18 Correct 49 ms 5184 KB Output is correct
19 Correct 8 ms 5096 KB Output is correct
20 Correct 19 ms 5012 KB Output is correct
21 Correct 26 ms 5096 KB Output is correct
22 Correct 8 ms 5032 KB Output is correct
23 Correct 7 ms 5108 KB Output is correct
24 Correct 7 ms 5024 KB Output is correct
25 Correct 29 ms 5160 KB Output is correct
26 Correct 19 ms 5096 KB Output is correct
27 Correct 8 ms 5028 KB Output is correct
28 Correct 37 ms 5132 KB Output is correct
29 Correct 31 ms 5092 KB Output is correct
30 Correct 31 ms 5164 KB Output is correct
31 Correct 7 ms 4984 KB Output is correct
32 Correct 9 ms 5012 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 14 ms 5064 KB Output is correct
35 Correct 7 ms 5028 KB Output is correct
36 Correct 12 ms 5044 KB Output is correct
37 Correct 8 ms 5008 KB Output is correct
38 Correct 7 ms 5020 KB Output is correct
39 Correct 22 ms 5068 KB Output is correct
40 Correct 45 ms 5148 KB Output is correct
41 Correct 21 ms 5104 KB Output is correct
42 Correct 33 ms 5056 KB Output is correct
43 Correct 23 ms 5088 KB Output is correct
44 Correct 28 ms 5076 KB Output is correct
45 Correct 20 ms 5040 KB Output is correct
46 Correct 7 ms 5028 KB Output is correct
47 Correct 28 ms 5064 KB Output is correct
48 Correct 29 ms 5128 KB Output is correct
49 Correct 11 ms 5024 KB Output is correct
50 Correct 34 ms 5132 KB Output is correct
51 Correct 27 ms 5056 KB Output is correct
52 Correct 7 ms 5028 KB Output is correct
53 Correct 8 ms 5012 KB Output is correct
54 Correct 27 ms 5064 KB Output is correct
55 Correct 7 ms 5032 KB Output is correct
56 Correct 53 ms 5152 KB Output is correct
57 Correct 24 ms 5124 KB Output is correct
58 Correct 41 ms 5128 KB Output is correct
59 Correct 30 ms 5104 KB Output is correct
60 Correct 30 ms 5036 KB Output is correct
61 Correct 7 ms 5032 KB Output is correct
62 Correct 7 ms 5028 KB Output is correct
63 Correct 8 ms 4984 KB Output is correct
64 Correct 7 ms 5156 KB Output is correct
65 Correct 7 ms 5020 KB Output is correct
66 Correct 9 ms 5028 KB Output is correct
67 Correct 12 ms 5016 KB Output is correct
68 Correct 7 ms 5024 KB Output is correct
69 Correct 8 ms 5036 KB Output is correct
70 Correct 8 ms 5112 KB Output is correct
71 Correct 42 ms 5168 KB Output is correct
72 Correct 13 ms 5024 KB Output is correct
73 Correct 57 ms 5148 KB Output is correct
74 Correct 36 ms 5168 KB Output is correct
75 Correct 8 ms 4984 KB Output is correct
76 Correct 46 ms 5120 KB Output is correct
77 Correct 51 ms 5160 KB Output is correct
78 Correct 12 ms 5028 KB Output is correct
79 Correct 28 ms 5104 KB Output is correct
80 Correct 51 ms 5152 KB Output is correct
81 Correct 51 ms 5140 KB Output is correct
82 Correct 50 ms 5232 KB Output is correct
83 Correct 8 ms 5112 KB Output is correct
84 Correct 33 ms 5040 KB Output is correct
85 Correct 35 ms 5172 KB Output is correct
86 Correct 15 ms 4984 KB Output is correct
87 Correct 7 ms 5016 KB Output is correct
88 Correct 14 ms 5032 KB Output is correct
89 Correct 12 ms 4984 KB Output is correct
90 Correct 7 ms 4984 KB Output is correct
91 Correct 13 ms 5032 KB Output is correct
92 Correct 7 ms 4996 KB Output is correct
93 Correct 11 ms 5120 KB Output is correct
94 Correct 8 ms 5036 KB Output is correct
95 Correct 11 ms 4984 KB Output is correct
96 Correct 10 ms 4984 KB Output is correct
97 Correct 7 ms 5024 KB Output is correct