#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int LOG = 18, TAKE = 500;
int find_best(int n) {
int mx = 0, id;
// last apperance of num and cnt
map<int, int> last;
for(id = 0; id < min(TAKE, n); id++){
auto c = ask(id);
int s = c[0] + c[1];
last[s] = c[0];
if(s == 0){
return id;
}
mx = max(mx, s);
}
while(id < n){
// find next biggest num
for(; id < n; id++){
auto c = ask(id);
int s = c[0] + c[1];
last[s] = c[0];
if(s == 0){
return id;
}
if(s == mx){
break;
}
}
int jump_point = 9;
bool ok = 1;
int jump = 1<<jump_point;
if(id + jump < n){
auto c = ask(id + jump);
int s = c[0] + c[1];
if(s == 0){
return id + jump;
}
if(last.count(s) && c[0] == last[s]){
ok = 0;
last[s] = c[0];
}
}
// overjump all biggest
for(int j = (ok ? jump_point - 1 : LOG); j >= 0; j--){
int jump = 1<<j;
if(id + jump >= n){
continue;
}
auto c = ask(id + jump);
int s = c[0] + c[1];
if(s == 0){
return id + jump;
}
if(last.count(s) && c[0] == last[s]){
id += jump;
last[s] = c[0];
}
}
// go to the next which is not max
id++;
}
assert(false);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
344 KB |
Output is correct |
3 |
Correct |
2 ms |
344 KB |
Output is correct |
4 |
Correct |
2 ms |
596 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
596 KB |
Output is correct |
2 |
Correct |
2 ms |
344 KB |
Output is correct |
3 |
Correct |
2 ms |
344 KB |
Output is correct |
4 |
Correct |
2 ms |
344 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
3 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Correct |
3 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
340 KB |
Output is correct |
11 |
Correct |
3 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
344 KB |
Output is correct |
13 |
Correct |
4 ms |
340 KB |
Output is correct |
14 |
Correct |
3 ms |
344 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
20 ms |
344 KB |
Output is correct |
17 |
Correct |
2 ms |
344 KB |
Output is correct |
18 |
Partially correct |
21 ms |
344 KB |
Partially correct - number of queries: 5709 |
19 |
Correct |
3 ms |
344 KB |
Output is correct |
20 |
Correct |
10 ms |
344 KB |
Output is correct |
21 |
Correct |
11 ms |
344 KB |
Output is correct |
22 |
Correct |
5 ms |
344 KB |
Output is correct |
23 |
Correct |
2 ms |
344 KB |
Output is correct |
24 |
Correct |
2 ms |
344 KB |
Output is correct |
25 |
Correct |
20 ms |
344 KB |
Output is correct |
26 |
Correct |
17 ms |
344 KB |
Output is correct |
27 |
Correct |
2 ms |
344 KB |
Output is correct |
28 |
Partially correct |
31 ms |
344 KB |
Partially correct - number of queries: 6407 |
29 |
Partially correct |
19 ms |
344 KB |
Partially correct - number of queries: 5095 |
30 |
Partially correct |
29 ms |
344 KB |
Partially correct - number of queries: 5657 |
31 |
Correct |
2 ms |
344 KB |
Output is correct |
32 |
Correct |
4 ms |
344 KB |
Output is correct |
33 |
Correct |
0 ms |
344 KB |
Output is correct |
34 |
Correct |
7 ms |
424 KB |
Output is correct |
35 |
Correct |
3 ms |
344 KB |
Output is correct |
36 |
Correct |
7 ms |
344 KB |
Output is correct |
37 |
Correct |
4 ms |
344 KB |
Output is correct |
38 |
Correct |
3 ms |
344 KB |
Output is correct |
39 |
Correct |
12 ms |
344 KB |
Output is correct |
40 |
Correct |
17 ms |
344 KB |
Output is correct |
41 |
Correct |
14 ms |
344 KB |
Output is correct |
42 |
Correct |
18 ms |
344 KB |
Output is correct |
43 |
Correct |
15 ms |
340 KB |
Output is correct |
44 |
Correct |
11 ms |
344 KB |
Output is correct |
45 |
Correct |
9 ms |
344 KB |
Output is correct |
46 |
Correct |
2 ms |
356 KB |
Output is correct |
47 |
Correct |
15 ms |
344 KB |
Output is correct |
48 |
Correct |
15 ms |
344 KB |
Output is correct |
49 |
Correct |
6 ms |
344 KB |
Output is correct |
50 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5709 |
51 |
Correct |
10 ms |
344 KB |
Output is correct |
52 |
Correct |
2 ms |
344 KB |
Output is correct |
53 |
Correct |
5 ms |
344 KB |
Output is correct |
54 |
Correct |
10 ms |
344 KB |
Output is correct |
55 |
Correct |
2 ms |
344 KB |
Output is correct |
56 |
Partially correct |
30 ms |
596 KB |
Partially correct - number of queries: 5708 |
57 |
Correct |
16 ms |
344 KB |
Output is correct |
58 |
Correct |
18 ms |
344 KB |
Output is correct |
59 |
Correct |
14 ms |
344 KB |
Output is correct |
60 |
Correct |
13 ms |
344 KB |
Output is correct |
61 |
Correct |
3 ms |
344 KB |
Output is correct |
62 |
Correct |
2 ms |
344 KB |
Output is correct |
63 |
Correct |
2 ms |
428 KB |
Output is correct |
64 |
Correct |
2 ms |
540 KB |
Output is correct |
65 |
Correct |
2 ms |
344 KB |
Output is correct |
66 |
Correct |
3 ms |
344 KB |
Output is correct |
67 |
Correct |
2 ms |
344 KB |
Output is correct |
68 |
Correct |
2 ms |
596 KB |
Output is correct |
69 |
Correct |
4 ms |
344 KB |
Output is correct |
70 |
Correct |
3 ms |
344 KB |
Output is correct |
71 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5695 |
72 |
Correct |
4 ms |
344 KB |
Output is correct |
73 |
Partially correct |
21 ms |
344 KB |
Partially correct - number of queries: 5618 |
74 |
Partially correct |
23 ms |
344 KB |
Partially correct - number of queries: 5650 |
75 |
Correct |
2 ms |
344 KB |
Output is correct |
76 |
Correct |
24 ms |
344 KB |
Output is correct |
77 |
Partially correct |
29 ms |
344 KB |
Partially correct - number of queries: 5706 |
78 |
Correct |
6 ms |
344 KB |
Output is correct |
79 |
Correct |
17 ms |
344 KB |
Output is correct |
80 |
Partially correct |
31 ms |
344 KB |
Partially correct - number of queries: 5721 |
81 |
Partially correct |
26 ms |
340 KB |
Partially correct - number of queries: 5708 |
82 |
Partially correct |
21 ms |
344 KB |
Partially correct - number of queries: 5651 |
83 |
Correct |
2 ms |
344 KB |
Output is correct |
84 |
Correct |
23 ms |
344 KB |
Output is correct |
85 |
Partially correct |
24 ms |
344 KB |
Partially correct - number of queries: 5691 |
86 |
Correct |
2 ms |
344 KB |
Output is correct |
87 |
Correct |
2 ms |
344 KB |
Output is correct |
88 |
Correct |
2 ms |
344 KB |
Output is correct |
89 |
Correct |
2 ms |
344 KB |
Output is correct |
90 |
Correct |
2 ms |
344 KB |
Output is correct |
91 |
Correct |
2 ms |
344 KB |
Output is correct |
92 |
Correct |
2 ms |
344 KB |
Output is correct |
93 |
Correct |
4 ms |
596 KB |
Output is correct |
94 |
Correct |
4 ms |
344 KB |
Output is correct |
95 |
Correct |
4 ms |
344 KB |
Output is correct |
96 |
Correct |
4 ms |
344 KB |
Output is correct |
97 |
Correct |
2 ms |
344 KB |
Output is correct |