#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
const int N = 200010;
const int S = 1000;
vector<int> memo[N];
inline vector<int> &query(int i) {
if (memo[i].empty())
memo[i] = ask(i);
return memo[i];
}
inline int querysum(int i) {
vector<int> &ret = query(i);
return ret[0]+ret[1];
}
int mx = 0, ans = -1;
void solve(int l, int r, int k, int dl, int dr)
{
if (l > r) return;
if (k == 0) return;
int start = l, rem = dl, cnt = 0;
for (int i = 1; i <= k; ++i) {
if (ans != -1) break;
int p = (l-1)+max(1, (r-l+2)/(k+1))*i;
if (p >= l && p <= r) {
if (querysum(p) == 0) { ans = p; break; }
if (querysum(p) != mx) { ++cnt; continue; }
int val = query(p)[0];
solve(start, p-1, val-rem, rem, query(p)[1]);
start = p+1;
rem = val;
}
}
if (start <= r && ans == -1 && cnt < k)
solve(start, r, k-(rem-dl), rem, dr);
}
int find_best(int n)
{
for (int i = 1; i < S; ++i) {
int p = max(1, n/S)*i;
if (p >= 0 && p < n) {
if (querysum(p) == 0)
return p;
mx = max(mx, querysum(p));
}
}
int start = 0, rem = 0;
for (int i = 1; i < S; ++i) {
int p = max(1, n/S)*i;
if (p >= 0 && p < n && querysum(p) == mx) { //querysum already computed
int val = query(p)[0]; //val equals the total number of higher gift than lollipop on the left
solve(start, p-1, val-rem, rem, query(p)[1]);
if (ans != -1) return ans;
start = p+1;
rem = val;
}
}
if (start <= n-1)
solve(start, n-1,mx-rem, rem, 0);
return ans;
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:61:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if (start <= n-1)
^~
prize.cpp:64:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
return ans;
^~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
5136 KB |
Output is correct |
2 |
Correct |
15 ms |
5136 KB |
Output is correct |
3 |
Correct |
13 ms |
5136 KB |
Output is correct |
4 |
Correct |
13 ms |
5136 KB |
Output is correct |
5 |
Correct |
11 ms |
5180 KB |
Output is correct |
6 |
Correct |
13 ms |
5180 KB |
Output is correct |
7 |
Correct |
9 ms |
5264 KB |
Output is correct |
8 |
Correct |
11 ms |
5264 KB |
Output is correct |
9 |
Correct |
14 ms |
5264 KB |
Output is correct |
10 |
Correct |
13 ms |
5264 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
5264 KB |
Output is correct |
2 |
Correct |
14 ms |
5264 KB |
Output is correct |
3 |
Correct |
11 ms |
5300 KB |
Output is correct |
4 |
Correct |
11 ms |
5300 KB |
Output is correct |
5 |
Correct |
10 ms |
5300 KB |
Output is correct |
6 |
Correct |
16 ms |
5300 KB |
Output is correct |
7 |
Correct |
10 ms |
5300 KB |
Output is correct |
8 |
Correct |
9 ms |
5300 KB |
Output is correct |
9 |
Correct |
16 ms |
5308 KB |
Output is correct |
10 |
Correct |
18 ms |
5308 KB |
Output is correct |
11 |
Correct |
16 ms |
5308 KB |
Output is correct |
12 |
Correct |
15 ms |
5308 KB |
Output is correct |
13 |
Correct |
16 ms |
5308 KB |
Output is correct |
14 |
Correct |
15 ms |
5308 KB |
Output is correct |
15 |
Correct |
18 ms |
5308 KB |
Output is correct |
16 |
Correct |
34 ms |
5308 KB |
Output is correct |
17 |
Correct |
11 ms |
5308 KB |
Output is correct |
18 |
Correct |
25 ms |
5392 KB |
Output is correct |
19 |
Correct |
14 ms |
5392 KB |
Output is correct |
20 |
Correct |
18 ms |
5392 KB |
Output is correct |
21 |
Correct |
25 ms |
5392 KB |
Output is correct |
22 |
Correct |
14 ms |
5392 KB |
Output is correct |
23 |
Correct |
13 ms |
5392 KB |
Output is correct |
24 |
Correct |
14 ms |
5392 KB |
Output is correct |
25 |
Correct |
30 ms |
5392 KB |
Output is correct |
26 |
Correct |
29 ms |
5392 KB |
Output is correct |
27 |
Correct |
14 ms |
5392 KB |
Output is correct |
28 |
Correct |
23 ms |
5392 KB |
Output is correct |
29 |
Correct |
24 ms |
5392 KB |
Output is correct |
30 |
Correct |
30 ms |
5444 KB |
Output is correct |
31 |
Correct |
11 ms |
5444 KB |
Output is correct |
32 |
Correct |
18 ms |
5444 KB |
Output is correct |
33 |
Correct |
6 ms |
5444 KB |
Output is correct |
34 |
Correct |
20 ms |
5444 KB |
Output is correct |
35 |
Correct |
17 ms |
5444 KB |
Output is correct |
36 |
Correct |
22 ms |
5444 KB |
Output is correct |
37 |
Correct |
13 ms |
5444 KB |
Output is correct |
38 |
Correct |
10 ms |
5444 KB |
Output is correct |
39 |
Correct |
24 ms |
5444 KB |
Output is correct |
40 |
Correct |
34 ms |
5444 KB |
Output is correct |
41 |
Correct |
27 ms |
5444 KB |
Output is correct |
42 |
Correct |
30 ms |
5444 KB |
Output is correct |
43 |
Correct |
24 ms |
5444 KB |
Output is correct |
44 |
Correct |
22 ms |
5444 KB |
Output is correct |
45 |
Correct |
21 ms |
5444 KB |
Output is correct |
46 |
Correct |
13 ms |
5444 KB |
Output is correct |
47 |
Correct |
16 ms |
5444 KB |
Output is correct |
48 |
Correct |
27 ms |
5444 KB |
Output is correct |
49 |
Correct |
12 ms |
5444 KB |
Output is correct |
50 |
Correct |
42 ms |
5444 KB |
Output is correct |
51 |
Correct |
30 ms |
5444 KB |
Output is correct |
52 |
Correct |
12 ms |
5444 KB |
Output is correct |
53 |
Correct |
13 ms |
5444 KB |
Output is correct |
54 |
Correct |
22 ms |
5444 KB |
Output is correct |
55 |
Correct |
16 ms |
5444 KB |
Output is correct |
56 |
Correct |
41 ms |
5444 KB |
Output is correct |
57 |
Correct |
35 ms |
5444 KB |
Output is correct |
58 |
Correct |
31 ms |
5444 KB |
Output is correct |
59 |
Correct |
26 ms |
5444 KB |
Output is correct |
60 |
Correct |
28 ms |
5444 KB |
Output is correct |
61 |
Correct |
15 ms |
5444 KB |
Output is correct |
62 |
Correct |
14 ms |
5444 KB |
Output is correct |
63 |
Correct |
10 ms |
5444 KB |
Output is correct |
64 |
Correct |
10 ms |
5444 KB |
Output is correct |
65 |
Correct |
14 ms |
5444 KB |
Output is correct |
66 |
Correct |
16 ms |
5444 KB |
Output is correct |
67 |
Correct |
14 ms |
5444 KB |
Output is correct |
68 |
Correct |
17 ms |
5444 KB |
Output is correct |
69 |
Correct |
22 ms |
5444 KB |
Output is correct |
70 |
Correct |
14 ms |
5444 KB |
Output is correct |
71 |
Correct |
46 ms |
5444 KB |
Output is correct |
72 |
Correct |
17 ms |
5444 KB |
Output is correct |
73 |
Correct |
41 ms |
5444 KB |
Output is correct |
74 |
Correct |
47 ms |
5444 KB |
Output is correct |
75 |
Correct |
11 ms |
5444 KB |
Output is correct |
76 |
Correct |
25 ms |
5444 KB |
Output is correct |
77 |
Correct |
44 ms |
5444 KB |
Output is correct |
78 |
Correct |
13 ms |
5444 KB |
Output is correct |
79 |
Correct |
32 ms |
5444 KB |
Output is correct |
80 |
Correct |
40 ms |
5444 KB |
Output is correct |
81 |
Correct |
31 ms |
5444 KB |
Output is correct |
82 |
Correct |
39 ms |
5444 KB |
Output is correct |
83 |
Correct |
16 ms |
5444 KB |
Output is correct |
84 |
Correct |
37 ms |
5456 KB |
Output is correct |
85 |
Correct |
44 ms |
5456 KB |
Output is correct |
86 |
Correct |
34 ms |
5456 KB |
Output is correct |
87 |
Correct |
12 ms |
5456 KB |
Output is correct |
88 |
Correct |
35 ms |
5456 KB |
Output is correct |
89 |
Correct |
39 ms |
5456 KB |
Output is correct |
90 |
Correct |
17 ms |
5456 KB |
Output is correct |
91 |
Correct |
18 ms |
5456 KB |
Output is correct |
92 |
Correct |
39 ms |
5456 KB |
Output is correct |
93 |
Correct |
23 ms |
5456 KB |
Output is correct |
94 |
Correct |
30 ms |
5456 KB |
Output is correct |
95 |
Correct |
47 ms |
5456 KB |
Output is correct |
96 |
Correct |
43 ms |
5456 KB |
Output is correct |
97 |
Correct |
42 ms |
5456 KB |
Output is correct |