oj.uz

답안 #984958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984958 2024-05-17T08:42:45 Z gaga999 Gap (APIO16_gap) C++17
30 / 100
 53 ms 5376 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
    {
        vector<llt> ar(2);
        MinMax(-MX, MX, &ar[0], &ar[1]);
        llt d = (ar[1] - ar[0] - 1) / (n - 1), x, y;
        for (llt i = ar[0] + 1; i + d <= ar[1]; i += d)
            MinMax(i, i + d - 1, &x, &y), ar.pb(x), ar.pb(y);
        sort(iter(ar)), uni(ar);
        llt ans = 0;
        for (int i = 1; i < size(ar); i++)
            tmax(ans, ar[i] - ar[i - 1]);
        return ans;
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 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 1 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 0 ms 2392 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 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 11 ms 2608 KB Output is correct
17 Correct 7 ms 2580 KB Output is correct
18 Correct 10 ms 2592 KB Output is correct
19 Correct 8 ms 2584 KB Output is correct
20 Correct 7 ms 2568 KB Output is correct
21 Correct 33 ms 3820 KB Output is correct
22 Correct 31 ms 3624 KB Output is correct
23 Correct 27 ms 3616 KB Output is correct
24 Correct 29 ms 3620 KB Output is correct
25 Correct 28 ms 3620 KB Output is correct
26 Correct 29 ms 3620 KB Output is correct
27 Correct 28 ms 3620 KB Output is correct
28 Correct 34 ms 3624 KB Output is correct
29 Correct 28 ms 3616 KB Output is correct
30 Correct 22 ms 3616 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 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 2392 KB Output is correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Correct 1 ms 2644 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 2388 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 2 ms 2392 KB Output is correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Correct 11 ms 3224 KB Output is correct
17 Correct 11 ms 3220 KB Output is correct
18 Correct 11 ms 3220 KB Output is correct
19 Correct 11 ms 3220 KB Output is correct
20 Partially correct 6 ms 3212 KB Partially correct
21 Correct 46 ms 5016 KB Output is correct
22 Correct 46 ms 5048 KB Output is correct
23 Correct 46 ms 4868 KB Output is correct
24 Correct 48 ms 5376 KB Output is correct
25 Incorrect 40 ms 4852 KB Output isn't correct
26 Correct 53 ms 4836 KB Output is correct
27 Correct 46 ms 4916 KB Output is correct
28 Correct 49 ms 5008 KB Output is correct
29 Correct 47 ms 5016 KB Output is correct
30 Partially correct 30 ms 5012 KB Partially correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct