//#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 next_thicc(int i) {
if(Thicc(i)) return i;
int it = lower_bound(all(blocks), i) - blocks.begin();
while(!IsThere(i, blocks[it])) it++;
int d = 0, msb = 31 - __builtin_clz(blocks[it] - i + 1);
for(int j = msb; j >= 0; j--) {
if(!IsThere(i, i + d + (1 << j)))
d += (1 << j);
} return i + 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 = 0; 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 = next_thicc(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;
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
4984 KB |
Output is correct |
| 2 |
Correct |
12 ms |
5044 KB |
Output is correct |
| 3 |
Correct |
18 ms |
5120 KB |
Output is correct |
| 4 |
Runtime error |
18 ms |
10060 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
10176 KB |
Unexpected end of file - token expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
