#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll linf = ll(1e18);
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;
#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)
#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif
map<int, vi> cache;
vi q(int i)
{
if (cache.find(i) != cache.end()) return cache[i];
return cache[i] = ask(i);
}
int find_best(int n)
{
int lollipop_cnt = 0;
rep(i, 500)
{
vi res = q(i);
if (res[0]+res[1]==0)
{
return i;
}
lollipop_cnt = max(lollipop_cnt, res[0] + res[1]);
}
int jump = 250;
int i = 500;
while (true)
{
vi base = q(i);
if (base[0]+base[1]==0)
{
return i;
}
if (base[0]+base[1]==lollipop_cnt)
{
if (i+ jump <n)
{
vi b2 = q(i + jump);
if (b2 == base)
{
i += jump;
continue;
}
}
int lo = i;
int hi = min(n, i+ jump);
while (lo+1<hi)
{
int mid = (lo + hi) / 2;
vi m = q(mid);
if (m == base)
{
lo = mid;
}
else hi = mid;
}
i = hi;
}
else
{
i++;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
7 ms |
344 KB |
Output is correct |
3 |
Correct |
6 ms |
460 KB |
Output is correct |
4 |
Correct |
4 ms |
464 KB |
Output is correct |
5 |
Correct |
5 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
4 ms |
472 KB |
Output is correct |
8 |
Correct |
5 ms |
340 KB |
Output is correct |
9 |
Correct |
5 ms |
344 KB |
Output is correct |
10 |
Correct |
8 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
4 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
344 KB |
Output is correct |
4 |
Correct |
5 ms |
344 KB |
Output is correct |
5 |
Correct |
5 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
5 ms |
344 KB |
Output is correct |
8 |
Correct |
4 ms |
344 KB |
Output is correct |
9 |
Correct |
5 ms |
460 KB |
Output is correct |
10 |
Correct |
9 ms |
344 KB |
Output is correct |
11 |
Correct |
6 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
344 KB |
Output is correct |
13 |
Correct |
8 ms |
600 KB |
Output is correct |
14 |
Correct |
3 ms |
344 KB |
Output is correct |
15 |
Correct |
6 ms |
440 KB |
Output is correct |
16 |
Correct |
16 ms |
852 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Partially correct |
33 ms |
948 KB |
Partially correct - number of queries: 5507 |
19 |
Correct |
3 ms |
344 KB |
Output is correct |
20 |
Correct |
10 ms |
720 KB |
Output is correct |
21 |
Correct |
12 ms |
600 KB |
Output is correct |
22 |
Correct |
5 ms |
344 KB |
Output is correct |
23 |
Correct |
4 ms |
612 KB |
Output is correct |
24 |
Correct |
3 ms |
600 KB |
Output is correct |
25 |
Correct |
15 ms |
916 KB |
Output is correct |
26 |
Correct |
23 ms |
728 KB |
Output is correct |
27 |
Correct |
6 ms |
600 KB |
Output is correct |
28 |
Partially correct |
25 ms |
848 KB |
Partially correct - number of queries: 5222 |
29 |
Correct |
20 ms |
848 KB |
Output is correct |
30 |
Partially correct |
27 ms |
804 KB |
Partially correct - number of queries: 5539 |
31 |
Correct |
2 ms |
344 KB |
Output is correct |
32 |
Correct |
6 ms |
344 KB |
Output is correct |
33 |
Correct |
0 ms |
344 KB |
Output is correct |
34 |
Correct |
11 ms |
684 KB |
Output is correct |
35 |
Correct |
8 ms |
344 KB |
Output is correct |
36 |
Correct |
11 ms |
600 KB |
Output is correct |
37 |
Correct |
5 ms |
712 KB |
Output is correct |
38 |
Correct |
2 ms |
344 KB |
Output is correct |
39 |
Correct |
14 ms |
600 KB |
Output is correct |
40 |
Correct |
25 ms |
848 KB |
Output is correct |
41 |
Correct |
12 ms |
760 KB |
Output is correct |
42 |
Correct |
15 ms |
848 KB |
Output is correct |
43 |
Correct |
14 ms |
600 KB |
Output is correct |
44 |
Correct |
8 ms |
600 KB |
Output is correct |
45 |
Correct |
14 ms |
856 KB |
Output is correct |
46 |
Correct |
2 ms |
344 KB |
Output is correct |
47 |
Correct |
19 ms |
720 KB |
Output is correct |
48 |
Correct |
23 ms |
848 KB |
Output is correct |
49 |
Correct |
6 ms |
344 KB |
Output is correct |
50 |
Partially correct |
30 ms |
1208 KB |
Partially correct - number of queries: 5489 |
51 |
Correct |
13 ms |
600 KB |
Output is correct |
52 |
Correct |
3 ms |
344 KB |
Output is correct |
53 |
Correct |
6 ms |
344 KB |
Output is correct |
54 |
Correct |
12 ms |
600 KB |
Output is correct |
55 |
Correct |
3 ms |
344 KB |
Output is correct |
56 |
Partially correct |
31 ms |
1260 KB |
Partially correct - number of queries: 5501 |
57 |
Correct |
18 ms |
856 KB |
Output is correct |
58 |
Correct |
19 ms |
856 KB |
Output is correct |
59 |
Correct |
15 ms |
788 KB |
Output is correct |
60 |
Correct |
22 ms |
600 KB |
Output is correct |
61 |
Correct |
4 ms |
344 KB |
Output is correct |
62 |
Correct |
2 ms |
344 KB |
Output is correct |
63 |
Correct |
8 ms |
600 KB |
Output is correct |
64 |
Correct |
7 ms |
344 KB |
Output is correct |
65 |
Correct |
6 ms |
344 KB |
Output is correct |
66 |
Correct |
8 ms |
600 KB |
Output is correct |
67 |
Correct |
6 ms |
460 KB |
Output is correct |
68 |
Correct |
2 ms |
344 KB |
Output is correct |
69 |
Correct |
9 ms |
592 KB |
Output is correct |
70 |
Correct |
6 ms |
344 KB |
Output is correct |
71 |
Partially correct |
25 ms |
936 KB |
Partially correct - number of queries: 5074 |
72 |
Correct |
8 ms |
576 KB |
Output is correct |
73 |
Partially correct |
22 ms |
848 KB |
Partially correct - number of queries: 5018 |
74 |
Partially correct |
27 ms |
1176 KB |
Partially correct - number of queries: 5042 |
75 |
Correct |
11 ms |
344 KB |
Output is correct |
76 |
Correct |
31 ms |
852 KB |
Output is correct |
77 |
Partially correct |
19 ms |
1100 KB |
Partially correct - number of queries: 5317 |
78 |
Correct |
11 ms |
600 KB |
Output is correct |
79 |
Correct |
14 ms |
848 KB |
Output is correct |
80 |
Partially correct |
22 ms |
896 KB |
Partially correct - number of queries: 5301 |
81 |
Partially correct |
41 ms |
1200 KB |
Partially correct - number of queries: 5311 |
82 |
Partially correct |
25 ms |
848 KB |
Partially correct - number of queries: 5270 |
83 |
Correct |
7 ms |
344 KB |
Output is correct |
84 |
Correct |
22 ms |
1236 KB |
Output is correct |
85 |
Partially correct |
29 ms |
952 KB |
Partially correct - number of queries: 5266 |
86 |
Correct |
7 ms |
600 KB |
Output is correct |
87 |
Correct |
7 ms |
600 KB |
Output is correct |
88 |
Correct |
10 ms |
1368 KB |
Output is correct |
89 |
Correct |
7 ms |
344 KB |
Output is correct |
90 |
Correct |
5 ms |
344 KB |
Output is correct |
91 |
Correct |
9 ms |
596 KB |
Output is correct |
92 |
Correct |
6 ms |
600 KB |
Output is correct |
93 |
Correct |
5 ms |
596 KB |
Output is correct |
94 |
Correct |
5 ms |
600 KB |
Output is correct |
95 |
Correct |
5 ms |
600 KB |
Output is correct |
96 |
Correct |
5 ms |
344 KB |
Output is correct |
97 |
Correct |
6 ms |
600 KB |
Output is correct |