#include "prize.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using ll = long long;
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
vector<vector<int>> memo;
vector<int> Ask(int n) {
if (memo[n].empty()) memo[n] = ask(n);
return memo[n];
}
int find_best(int n) {
memo.resize(n);
int cnt = 0;
rep (i, 500) {
auto res = Ask(i);
chmax(cnt, res[0] + res[1]);
if (res[0] + res[1] == 0) return i;
}
int x = 500;
while (x < n) {
int y = 0;
while (x < n) {
auto res = Ask(x);
if (res[0] + res[1] == 0) return x;
if (res[0] + res[1] == cnt) {
y = res[0];
break;
}
++x;
}
int ok = 0, ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (mid <= x) ok = mid;
else {
auto res = Ask(mid);
if (res[0] + res[1] == 0) return mid;
if (res[0] + res[1] < cnt) ng = mid;
else if (res[0] > y) ng = mid;
else ok = mid;
}
}
x = ok + 1;
}
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
60 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 3 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4952 KB |
Output is correct |
| 7 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 8 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 9 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 10 |
Correct |
4 ms |
4952 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 3 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 4 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 5 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4952 KB |
Output is correct |
| 7 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 8 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 9 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 10 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 11 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 12 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 13 |
Correct |
7 ms |
4952 KB |
Output is correct |
| 14 |
Correct |
3 ms |
856 KB |
Output is correct |
| 15 |
Correct |
7 ms |
4952 KB |
Output is correct |
| 16 |
Correct |
22 ms |
5448 KB |
Output is correct |
| 17 |
Correct |
3 ms |
5144 KB |
Output is correct |
| 18 |
Partially correct |
19 ms |
5464 KB |
Partially correct - number of queries: 5419 |
| 19 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2648 KB |
Output is correct |
| 21 |
Correct |
10 ms |
5204 KB |
Output is correct |
| 22 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 23 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 24 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 25 |
Correct |
12 ms |
5208 KB |
Output is correct |
| 26 |
Correct |
15 ms |
5208 KB |
Output is correct |
| 27 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 28 |
Correct |
34 ms |
5200 KB |
Output is correct |
| 29 |
Correct |
19 ms |
5208 KB |
Output is correct |
| 30 |
Partially correct |
17 ms |
5200 KB |
Partially correct - number of queries: 5375 |
| 31 |
Correct |
3 ms |
4952 KB |
Output is correct |
| 32 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 33 |
Correct |
0 ms |
344 KB |
Output is correct |
| 34 |
Correct |
11 ms |
5164 KB |
Output is correct |
| 35 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 36 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 37 |
Correct |
4 ms |
5208 KB |
Output is correct |
| 38 |
Correct |
3 ms |
4952 KB |
Output is correct |
| 39 |
Correct |
10 ms |
5464 KB |
Output is correct |
| 40 |
Correct |
20 ms |
5208 KB |
Output is correct |
| 41 |
Correct |
11 ms |
5200 KB |
Output is correct |
| 42 |
Correct |
13 ms |
5232 KB |
Output is correct |
| 43 |
Correct |
14 ms |
5208 KB |
Output is correct |
| 44 |
Correct |
10 ms |
5208 KB |
Output is correct |
| 45 |
Correct |
8 ms |
5208 KB |
Output is correct |
| 46 |
Correct |
3 ms |
4952 KB |
Output is correct |
| 47 |
Correct |
14 ms |
5208 KB |
Output is correct |
| 48 |
Correct |
13 ms |
5472 KB |
Output is correct |
| 49 |
Correct |
7 ms |
5208 KB |
Output is correct |
| 50 |
Partially correct |
26 ms |
5264 KB |
Partially correct - number of queries: 5420 |
| 51 |
Correct |
12 ms |
4952 KB |
Output is correct |
| 52 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 53 |
Correct |
5 ms |
5208 KB |
Output is correct |
| 54 |
Correct |
9 ms |
5148 KB |
Output is correct |
| 55 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 56 |
Partially correct |
22 ms |
5220 KB |
Partially correct - number of queries: 5411 |
| 57 |
Correct |
11 ms |
5208 KB |
Output is correct |
| 58 |
Correct |
16 ms |
5208 KB |
Output is correct |
| 59 |
Correct |
21 ms |
5208 KB |
Output is correct |
| 60 |
Correct |
17 ms |
5208 KB |
Output is correct |
| 61 |
Correct |
4 ms |
5208 KB |
Output is correct |
| 62 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 63 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 64 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 65 |
Correct |
4 ms |
5208 KB |
Output is correct |
| 66 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 67 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 68 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 69 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 70 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 71 |
Partially correct |
29 ms |
5208 KB |
Partially correct - number of queries: 5259 |
| 72 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 73 |
Partially correct |
26 ms |
5236 KB |
Partially correct - number of queries: 5196 |
| 74 |
Partially correct |
27 ms |
5440 KB |
Partially correct - number of queries: 5223 |
| 75 |
Correct |
5 ms |
5204 KB |
Output is correct |
| 76 |
Correct |
33 ms |
5208 KB |
Output is correct |
| 77 |
Partially correct |
28 ms |
5208 KB |
Partially correct - number of queries: 5505 |
| 78 |
Correct |
6 ms |
4952 KB |
Output is correct |
| 79 |
Correct |
16 ms |
5208 KB |
Output is correct |
| 80 |
Partially correct |
34 ms |
5208 KB |
Partially correct - number of queries: 5480 |
| 81 |
Partially correct |
35 ms |
5208 KB |
Partially correct - number of queries: 5481 |
| 82 |
Partially correct |
30 ms |
5412 KB |
Partially correct - number of queries: 5444 |
| 83 |
Correct |
8 ms |
4952 KB |
Output is correct |
| 84 |
Correct |
20 ms |
5480 KB |
Output is correct |
| 85 |
Partially correct |
26 ms |
5200 KB |
Partially correct - number of queries: 5480 |
| 86 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 87 |
Correct |
6 ms |
5148 KB |
Output is correct |
| 88 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 89 |
Correct |
3 ms |
4952 KB |
Output is correct |
| 90 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 91 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 92 |
Correct |
4 ms |
4952 KB |
Output is correct |
| 93 |
Correct |
5 ms |
5140 KB |
Output is correct |
| 94 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 95 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 96 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 97 |
Correct |
4 ms |
4952 KB |
Output is correct |
