//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
inline int myrand(int l, int r) {
int ret = rand(); ret <<= 15; ret ^= rand();
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
return os<<"(" <<p.first<<", "<<p.second<<")";
}
const int maxn = 200010;
vector<int> memo[maxn];
int mx_tot = 0;
vector<int> blocks;
int Left(int i) {
if(memo[i].empty()) memo[i] = ask(i);
return memo[i][0];
}
int Total(int i) {
if(memo[i].empty()) memo[i] = ask(i);
return memo[i][0] + memo[i][1];
}
bool IsThere(int i, int j) {
if(Total(j) < mx_tot) return true;
return (Left(j) - Left(i)) > 0;
}
bool Thicc(int i) {
return Total(i) < mx_tot;
}
int NextThicc(int i) {
if(Thicc(i)) return i;
int it = lower_bound(all(blocks), i) - blocks.begin();
while(!IsThere(i, blocks[it])) it++;
int d = max((it == 0 ? -1 : blocks[it-1]), i);
for(int j = 25; j >= 0; j--) {
if(d + (1 << j) >= blocks[it]) continue;
if(!IsThere(i, d + (1 << j)))
d += (1 << j);
} return d + 1;
}
int find_best(int n) { int debug = 0;
if(!debug) if(n <= 5000)
for(int i = 0; i < n; i++)
if(Total(i) == 0)
return i;
int k = 782; int sz = n / k;
for(int i = sz; i < n; i += sz) {
blocks.push_back(i);
} if(blocks.back() != n-1) blocks.push_back(n-1);
for(int b : blocks) mx_tot = max(mx_tot, Total(b));
int now = 0;
while(true) {
now = NextThicc(now);
if(Total(now) == 0) return now;
now++;
}
}
Compilation message
prize.cpp: In function 'int myrand(int, int)':
prize.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
^~
prize.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
4988 KB |
Output is correct |
2 |
Correct |
12 ms |
5048 KB |
Output is correct |
3 |
Correct |
13 ms |
5232 KB |
Output is correct |
4 |
Correct |
14 ms |
5232 KB |
Output is correct |
5 |
Correct |
12 ms |
5232 KB |
Output is correct |
6 |
Correct |
14 ms |
5232 KB |
Output is correct |
7 |
Correct |
15 ms |
5232 KB |
Output is correct |
8 |
Correct |
13 ms |
5232 KB |
Output is correct |
9 |
Correct |
15 ms |
5232 KB |
Output is correct |
10 |
Correct |
9 ms |
5232 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
5232 KB |
Output is correct |
2 |
Correct |
10 ms |
5236 KB |
Output is correct |
3 |
Correct |
14 ms |
5236 KB |
Output is correct |
4 |
Correct |
15 ms |
5236 KB |
Output is correct |
5 |
Correct |
13 ms |
5260 KB |
Output is correct |
6 |
Correct |
14 ms |
5284 KB |
Output is correct |
7 |
Correct |
12 ms |
5284 KB |
Output is correct |
8 |
Correct |
13 ms |
5284 KB |
Output is correct |
9 |
Correct |
13 ms |
5400 KB |
Output is correct |
10 |
Correct |
11 ms |
5400 KB |
Output is correct |
11 |
Correct |
13 ms |
5400 KB |
Output is correct |
12 |
Correct |
13 ms |
5400 KB |
Output is correct |
13 |
Correct |
16 ms |
5400 KB |
Output is correct |
14 |
Correct |
14 ms |
5400 KB |
Output is correct |
15 |
Correct |
18 ms |
5400 KB |
Output is correct |
16 |
Correct |
35 ms |
5400 KB |
Output is correct |
17 |
Correct |
14 ms |
5400 KB |
Output is correct |
18 |
Correct |
60 ms |
5400 KB |
Output is correct |
19 |
Correct |
16 ms |
5400 KB |
Output is correct |
20 |
Correct |
13 ms |
5400 KB |
Output is correct |
21 |
Correct |
14 ms |
5400 KB |
Output is correct |
22 |
Correct |
16 ms |
5400 KB |
Output is correct |
23 |
Correct |
11 ms |
5400 KB |
Output is correct |
24 |
Correct |
11 ms |
5400 KB |
Output is correct |
25 |
Correct |
17 ms |
5400 KB |
Output is correct |
26 |
Correct |
22 ms |
5400 KB |
Output is correct |
27 |
Correct |
12 ms |
5400 KB |
Output is correct |
28 |
Correct |
36 ms |
5400 KB |
Output is correct |
29 |
Correct |
34 ms |
5400 KB |
Output is correct |
30 |
Correct |
41 ms |
5400 KB |
Output is correct |
31 |
Correct |
11 ms |
5400 KB |
Output is correct |
32 |
Correct |
12 ms |
5400 KB |
Output is correct |
33 |
Correct |
6 ms |
5400 KB |
Output is correct |
34 |
Correct |
20 ms |
5400 KB |
Output is correct |
35 |
Correct |
12 ms |
5400 KB |
Output is correct |
36 |
Correct |
23 ms |
5400 KB |
Output is correct |
37 |
Correct |
12 ms |
5400 KB |
Output is correct |
38 |
Correct |
10 ms |
5400 KB |
Output is correct |
39 |
Correct |
27 ms |
5400 KB |
Output is correct |
40 |
Correct |
33 ms |
5400 KB |
Output is correct |
41 |
Correct |
36 ms |
5400 KB |
Output is correct |
42 |
Correct |
33 ms |
5400 KB |
Output is correct |
43 |
Correct |
36 ms |
5400 KB |
Output is correct |
44 |
Correct |
31 ms |
5400 KB |
Output is correct |
45 |
Correct |
27 ms |
5400 KB |
Output is correct |
46 |
Correct |
15 ms |
5400 KB |
Output is correct |
47 |
Correct |
30 ms |
5400 KB |
Output is correct |
48 |
Correct |
37 ms |
5400 KB |
Output is correct |
49 |
Correct |
15 ms |
5400 KB |
Output is correct |
50 |
Correct |
42 ms |
5400 KB |
Output is correct |
51 |
Correct |
22 ms |
5400 KB |
Output is correct |
52 |
Correct |
17 ms |
5400 KB |
Output is correct |
53 |
Correct |
17 ms |
5400 KB |
Output is correct |
54 |
Correct |
30 ms |
5400 KB |
Output is correct |
55 |
Correct |
12 ms |
5400 KB |
Output is correct |
56 |
Correct |
38 ms |
5404 KB |
Output is correct |
57 |
Correct |
37 ms |
5404 KB |
Output is correct |
58 |
Correct |
34 ms |
5404 KB |
Output is correct |
59 |
Correct |
29 ms |
5404 KB |
Output is correct |
60 |
Correct |
27 ms |
5404 KB |
Output is correct |
61 |
Correct |
13 ms |
5404 KB |
Output is correct |
62 |
Correct |
11 ms |
5404 KB |
Output is correct |
63 |
Correct |
11 ms |
5404 KB |
Output is correct |
64 |
Correct |
9 ms |
5404 KB |
Output is correct |
65 |
Correct |
13 ms |
5404 KB |
Output is correct |
66 |
Correct |
16 ms |
5404 KB |
Output is correct |
67 |
Correct |
14 ms |
5404 KB |
Output is correct |
68 |
Correct |
13 ms |
5404 KB |
Output is correct |
69 |
Correct |
15 ms |
5404 KB |
Output is correct |
70 |
Correct |
10 ms |
5404 KB |
Output is correct |
71 |
Correct |
35 ms |
5412 KB |
Output is correct |
72 |
Correct |
12 ms |
5412 KB |
Output is correct |
73 |
Correct |
46 ms |
5412 KB |
Output is correct |
74 |
Correct |
46 ms |
5412 KB |
Output is correct |
75 |
Correct |
12 ms |
5412 KB |
Output is correct |
76 |
Correct |
48 ms |
5412 KB |
Output is correct |
77 |
Correct |
50 ms |
5412 KB |
Output is correct |
78 |
Correct |
14 ms |
5412 KB |
Output is correct |
79 |
Correct |
36 ms |
5412 KB |
Output is correct |
80 |
Correct |
42 ms |
5436 KB |
Output is correct |
81 |
Correct |
44 ms |
5436 KB |
Output is correct |
82 |
Correct |
58 ms |
5436 KB |
Output is correct |
83 |
Correct |
13 ms |
5436 KB |
Output is correct |
84 |
Correct |
34 ms |
5436 KB |
Output is correct |
85 |
Correct |
42 ms |
5436 KB |
Output is correct |
86 |
Correct |
34 ms |
5436 KB |
Output is correct |
87 |
Correct |
12 ms |
5436 KB |
Output is correct |
88 |
Correct |
32 ms |
5436 KB |
Output is correct |
89 |
Correct |
36 ms |
5436 KB |
Output is correct |
90 |
Correct |
10 ms |
5436 KB |
Output is correct |
91 |
Correct |
34 ms |
5436 KB |
Output is correct |
92 |
Correct |
35 ms |
5436 KB |
Output is correct |
93 |
Correct |
43 ms |
5436 KB |
Output is correct |
94 |
Correct |
36 ms |
5436 KB |
Output is correct |
95 |
Correct |
26 ms |
5436 KB |
Output is correct |
96 |
Correct |
39 ms |
5436 KB |
Output is correct |
97 |
Correct |
37 ms |
5436 KB |
Output is correct |