| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 984967 |
2024-05-17T08:49:06 Z |
gaga999 |
Gap (APIO16_gap) |
C++17 |
|
33 ms |
5432 KB |
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define inin(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef unsigned long long ull;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
typedef complex<double> cd;
// const int M = 998244353;
// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);
void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }
inline char gc()
{
const static int SZ = 1 << 16;
static char buf[SZ], *p1, *p2;
if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
return -1;
return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
x = 0;
bool f = 0;
char c = gc();
while (!isdigit(c))
f ^= !(c ^ 45), c = gc();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
f && (x = -x), rd(y...);
}
template <typename T>
void prt(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
prt(x / 10);
putchar((x % 10) ^ 48);
}
const llt MX = 1ll << 60;
void MinMax(llt, llt, llt *, llt *);
llt findGap(int t, int n)
{
if (t == 1 || n <= 8)
{
vector<llt> ar(n + 2);
ar[0] = -MX, ar[n + 1] = MX;
for (int i = 0; i < (n + 1) >> 1; i++)
MinMax(ar[i] + 1, ar[n - i + 1] - 1, &ar[i + 1], &ar[n - i]);
llt ans = 0;
for (int i = 2; i <= n; i++)
tmax(ans, ar[i] - ar[i - 1]);
return ans;
}
else
{
assert(n <= 16);
vector<llt> ar(2);
MinMax(-MX, MX, &ar[0], &ar[1]);
llt ans = (ar[1] - ar[0] - 1) / (n - 1) + 1, x, y;
for (llt i = ar[0] + 1; i + ans <= ar[1]; i += ans)
MinMax(i, i + ans - 1, &x, &y), ar.pb(x), ar.pb(y);
sort(iter(ar)), uni(ar);
for (int i = 1; i < size(ar); i++)
tmax(ans, ar[i] - ar[i - 1]);
return ans;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
7 ms |
2580 KB |
Output is correct |
| 17 |
Correct |
7 ms |
2752 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2584 KB |
Output is correct |
| 19 |
Correct |
7 ms |
2744 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2572 KB |
Output is correct |
| 21 |
Correct |
28 ms |
3620 KB |
Output is correct |
| 22 |
Correct |
28 ms |
3624 KB |
Output is correct |
| 23 |
Correct |
29 ms |
3620 KB |
Output is correct |
| 24 |
Correct |
33 ms |
3628 KB |
Output is correct |
| 25 |
Correct |
25 ms |
3616 KB |
Output is correct |
| 26 |
Correct |
28 ms |
3620 KB |
Output is correct |
| 27 |
Correct |
30 ms |
3624 KB |
Output is correct |
| 28 |
Correct |
29 ms |
3816 KB |
Output is correct |
| 29 |
Correct |
31 ms |
3612 KB |
Output is correct |
| 30 |
Correct |
23 ms |
3608 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2472 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 7 |
Runtime error |
3 ms |
4672 KB |
Execution killed with signal 6 |
| 8 |
Runtime error |
3 ms |
4696 KB |
Execution killed with signal 6 |
| 9 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 10 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 11 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 12 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 13 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 14 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 15 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 16 |
Runtime error |
5 ms |
4892 KB |
Execution killed with signal 6 |
| 17 |
Runtime error |
6 ms |
4892 KB |
Execution killed with signal 6 |
| 18 |
Runtime error |
5 ms |
4896 KB |
Execution killed with signal 6 |
| 19 |
Runtime error |
5 ms |
4888 KB |
Execution killed with signal 6 |
| 20 |
Runtime error |
4 ms |
4876 KB |
Execution killed with signal 6 |
| 21 |
Runtime error |
15 ms |
5388 KB |
Execution killed with signal 6 |
| 22 |
Runtime error |
16 ms |
5332 KB |
Execution killed with signal 6 |
| 23 |
Runtime error |
14 ms |
5408 KB |
Execution killed with signal 6 |
| 24 |
Runtime error |
14 ms |
5412 KB |
Execution killed with signal 6 |
| 25 |
Runtime error |
11 ms |
5404 KB |
Execution killed with signal 6 |
| 26 |
Runtime error |
15 ms |
5412 KB |
Execution killed with signal 6 |
| 27 |
Runtime error |
15 ms |
5416 KB |
Execution killed with signal 6 |
| 28 |
Runtime error |
14 ms |
5432 KB |
Execution killed with signal 6 |
| 29 |
Runtime error |
14 ms |
5416 KB |
Execution killed with signal 6 |
| 30 |
Runtime error |
9 ms |
5412 KB |
Execution killed with signal 6 |
| 31 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
| 32 |
Runtime error |
2 ms |
4696 KB |
Execution killed with signal 6 |
