#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
vector< vector< int > > memo;
int TOT = 0;
vector< int > ASK(int a){
if(memo[a][0] != -1) return memo[a];
else{
TOT++;
//assert(TOT < 10000);
return memo[a] = ask(a);
}
}
int find_best(int n) {
int poppy_index = -1;
int poppy_tot = 0;
memo.resize(n, vector< int >(2,-1));
for(int i = 0; i < min(n,50); i++){
vector< int > query = ASK(i);
if(query[0] + query[1] >= poppy_tot){
poppy_tot = query[0] + query[1];
poppy_index = i;
}else if(query[0] + query[1] == 0){
return i;
}
}
int curr = poppy_index+1;
while(curr < n){
vector< int > query = ASK(curr);
if(query[0] + query[1] == 0) return curr;
while(query[0] + query[1] != poppy_tot){
curr++;
query = ASK(curr);
if(query[0] + query[1] == 0) return curr;
}
int left = curr+1;
int right = n-1;
while(left < right){
int mid = (left+right)/2;
vector< int > Q = ASK(mid);
if(Q[0] + Q[1] == 0) return mid;
if(Q[0] + Q[1] == poppy_tot && Q[0] - query[0] == 0) left = mid+1;
else if(Q[0] + Q[1] == poppy_tot && Q[0] - query[0] > 0) right = mid-1;
else if(Q[0] + Q[1] != poppy_tot) right = mid;
}
curr = left;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
11384 KB |
Output is correct |
2 |
Correct |
20 ms |
11384 KB |
Output is correct |
3 |
Correct |
20 ms |
11256 KB |
Output is correct |
4 |
Correct |
20 ms |
11256 KB |
Output is correct |
5 |
Correct |
20 ms |
11256 KB |
Output is correct |
6 |
Correct |
20 ms |
11256 KB |
Output is correct |
7 |
Correct |
20 ms |
11268 KB |
Output is correct |
8 |
Correct |
20 ms |
11256 KB |
Output is correct |
9 |
Correct |
20 ms |
11268 KB |
Output is correct |
10 |
Correct |
20 ms |
11256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
11304 KB |
Output is correct |
2 |
Correct |
20 ms |
11256 KB |
Output is correct |
3 |
Correct |
20 ms |
11256 KB |
Output is correct |
4 |
Correct |
20 ms |
11188 KB |
Output is correct |
5 |
Correct |
20 ms |
11256 KB |
Output is correct |
6 |
Correct |
21 ms |
11256 KB |
Output is correct |
7 |
Correct |
20 ms |
11188 KB |
Output is correct |
8 |
Correct |
20 ms |
11384 KB |
Output is correct |
9 |
Correct |
20 ms |
11256 KB |
Output is correct |
10 |
Correct |
20 ms |
11256 KB |
Output is correct |
11 |
Correct |
23 ms |
11256 KB |
Output is correct |
12 |
Correct |
20 ms |
11256 KB |
Output is correct |
13 |
Correct |
28 ms |
11256 KB |
Output is correct |
14 |
Correct |
10 ms |
1400 KB |
Output is correct |
15 |
Correct |
28 ms |
11256 KB |
Output is correct |
16 |
Partially correct |
91 ms |
11268 KB |
Partially correct - number of queries: 6714 |
17 |
Correct |
20 ms |
11256 KB |
Output is correct |
18 |
Partially correct |
95 ms |
11192 KB |
Partially correct - number of queries: 7846 |
19 |
Correct |
20 ms |
11256 KB |
Output is correct |
20 |
Correct |
36 ms |
5880 KB |
Output is correct |
21 |
Correct |
50 ms |
11176 KB |
Output is correct |
22 |
Correct |
23 ms |
11256 KB |
Output is correct |
23 |
Correct |
20 ms |
11256 KB |
Output is correct |
24 |
Correct |
20 ms |
11256 KB |
Output is correct |
25 |
Correct |
56 ms |
11256 KB |
Output is correct |
26 |
Correct |
62 ms |
11256 KB |
Output is correct |
27 |
Correct |
20 ms |
11256 KB |
Output is correct |
28 |
Partially correct |
94 ms |
11256 KB |
Partially correct - number of queries: 7395 |
29 |
Partially correct |
85 ms |
11256 KB |
Partially correct - number of queries: 5618 |
30 |
Partially correct |
80 ms |
11184 KB |
Partially correct - number of queries: 7791 |
31 |
Correct |
20 ms |
11256 KB |
Output is correct |
32 |
Correct |
26 ms |
11256 KB |
Output is correct |
33 |
Correct |
2 ms |
248 KB |
Output is correct |
34 |
Correct |
39 ms |
11188 KB |
Output is correct |
35 |
Correct |
21 ms |
11256 KB |
Output is correct |
36 |
Correct |
46 ms |
11256 KB |
Output is correct |
37 |
Correct |
21 ms |
11256 KB |
Output is correct |
38 |
Correct |
20 ms |
11256 KB |
Output is correct |
39 |
Correct |
61 ms |
11256 KB |
Output is correct |
40 |
Partially correct |
74 ms |
11176 KB |
Partially correct - number of queries: 6680 |
41 |
Correct |
51 ms |
11256 KB |
Output is correct |
42 |
Correct |
65 ms |
11272 KB |
Output is correct |
43 |
Correct |
60 ms |
11256 KB |
Output is correct |
44 |
Correct |
41 ms |
11256 KB |
Output is correct |
45 |
Correct |
46 ms |
11256 KB |
Output is correct |
46 |
Correct |
20 ms |
11256 KB |
Output is correct |
47 |
Correct |
59 ms |
11188 KB |
Output is correct |
48 |
Partially correct |
80 ms |
11268 KB |
Partially correct - number of queries: 5829 |
49 |
Correct |
22 ms |
11256 KB |
Output is correct |
50 |
Partially correct |
84 ms |
11256 KB |
Partially correct - number of queries: 7843 |
51 |
Correct |
59 ms |
11188 KB |
Output is correct |
52 |
Correct |
20 ms |
11384 KB |
Output is correct |
53 |
Correct |
21 ms |
11256 KB |
Output is correct |
54 |
Correct |
50 ms |
11256 KB |
Output is correct |
55 |
Correct |
20 ms |
11256 KB |
Output is correct |
56 |
Partially correct |
103 ms |
11260 KB |
Partially correct - number of queries: 7840 |
57 |
Partially correct |
52 ms |
11256 KB |
Partially correct - number of queries: 5746 |
58 |
Partially correct |
84 ms |
11256 KB |
Partially correct - number of queries: 5817 |
59 |
Correct |
45 ms |
11184 KB |
Output is correct |
60 |
Correct |
43 ms |
11272 KB |
Output is correct |
61 |
Correct |
20 ms |
11312 KB |
Output is correct |
62 |
Correct |
20 ms |
11260 KB |
Output is correct |
63 |
Correct |
21 ms |
11272 KB |
Output is correct |
64 |
Correct |
20 ms |
11256 KB |
Output is correct |
65 |
Correct |
21 ms |
11256 KB |
Output is correct |
66 |
Correct |
21 ms |
11256 KB |
Output is correct |
67 |
Correct |
20 ms |
11192 KB |
Output is correct |
68 |
Correct |
20 ms |
11256 KB |
Output is correct |
69 |
Correct |
24 ms |
11256 KB |
Output is correct |
70 |
Correct |
20 ms |
11256 KB |
Output is correct |
71 |
Partially correct |
100 ms |
11260 KB |
Partially correct - number of queries: 7790 |
72 |
Correct |
27 ms |
11384 KB |
Output is correct |
73 |
Partially correct |
109 ms |
11256 KB |
Partially correct - number of queries: 7697 |
74 |
Partially correct |
79 ms |
11292 KB |
Partially correct - number of queries: 7755 |
75 |
Correct |
20 ms |
11256 KB |
Output is correct |
76 |
Partially correct |
56 ms |
11256 KB |
Partially correct - number of queries: 6671 |
77 |
Partially correct |
63 ms |
11256 KB |
Partially correct - number of queries: 7881 |
78 |
Correct |
28 ms |
11256 KB |
Output is correct |
79 |
Correct |
39 ms |
11256 KB |
Output is correct |
80 |
Partially correct |
107 ms |
11256 KB |
Partially correct - number of queries: 7883 |
81 |
Partially correct |
63 ms |
11256 KB |
Partially correct - number of queries: 7859 |
82 |
Partially correct |
92 ms |
11256 KB |
Partially correct - number of queries: 7815 |
83 |
Correct |
24 ms |
11268 KB |
Output is correct |
84 |
Partially correct |
79 ms |
11256 KB |
Partially correct - number of queries: 6450 |
85 |
Partially correct |
71 ms |
11256 KB |
Partially correct - number of queries: 7867 |
86 |
Incorrect |
96 ms |
11188 KB |
Incorrect |
87 |
Halted |
0 ms |
0 KB |
- |