Submission #1083429

# Submission time Handle Problem Language Result Execution time Memory
1083429 2024-09-03T05:58:27 Z dong_gas Gap (APIO16_gap) C++17
66.4577 / 100
70 ms 4356 KB
#include <bits/stdc++.h>

#include "gap.h"

using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

ll a[100201];
ll l[100201], r[100201];
pll b[100201];
const ll inf = 1'000'000'000'000'000'000;

ll findGap(int T, int n) {
    if (T == 1) {
        ll L = 1, R = n, mn, mx;
        ll low = 0, high = 1e18;
        while (L < R) {
            MinMax(low, high, &mn, &mx);
            a[L++] = mn, a[R--] = mx;
            low = mn + 1, high = mx - 1;
        }
        if (L == R) {
            MinMax(low, high, &mn, &mx);
            a[L] = mn;
        }
        ll ret = 0;
        for (int i = 2; i <= n; i++) ret = max(ret, a[i] - a[i - 1]);
        return ret;
    }
    ll mn, mx, ret = 0;
    MinMax(0, inf, &mn, &mx);
    a[1] = mn, a[n] = mx;
    if (n == 2) {
        return mx - mn;
    }
    ll gap = 1 + (mx - mn + 1) / (n - 1), cnt = 1;
    for (ll i = a[1] + 1;; i += gap, cnt++) {
        l[cnt] = i, r[cnt] = i + gap - 1;
        if (r[cnt] > a[n]) {
            r[cnt] = a[n];
            break;
        }
    }
    for (int i = 1; i <= cnt; i++) {
        MinMax(l[i], r[i], &mn, &mx);
        b[i] = {mn, mx};
    }
    ll bef = a[1];
    for (int i = 1; i <= cnt; i++) {
        if (b[i].first == -1) continue;
        if (bef != -1) {
            MinMax(bef, b[i].first, &mn, &mx);
            ret = max(ret, mx - mn);
        }
        bef = b[i].second;
    }
    return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 6 ms 856 KB Output is correct
18 Correct 7 ms 696 KB Output is correct
19 Correct 7 ms 856 KB Output is correct
20 Correct 5 ms 700 KB Output is correct
21 Correct 27 ms 1912 KB Output is correct
22 Correct 28 ms 1768 KB Output is correct
23 Correct 26 ms 1912 KB Output is correct
24 Correct 26 ms 1880 KB Output is correct
25 Correct 23 ms 1920 KB Output is correct
26 Correct 28 ms 1872 KB Output is correct
27 Correct 27 ms 1880 KB Output is correct
28 Correct 27 ms 1872 KB Output is correct
29 Correct 25 ms 1916 KB Output is correct
30 Correct 22 ms 1880 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 13 ms 1240 KB Partially correct
17 Partially correct 13 ms 1368 KB Partially correct
18 Partially correct 13 ms 1464 KB Partially correct
19 Partially correct 14 ms 1368 KB Partially correct
20 Partially correct 5 ms 1368 KB Partially correct
21 Partially correct 55 ms 4120 KB Partially correct
22 Partially correct 63 ms 4180 KB Partially correct
23 Partially correct 64 ms 4208 KB Partially correct
24 Partially correct 67 ms 4320 KB Partially correct
25 Partially correct 60 ms 4176 KB Partially correct
26 Partially correct 56 ms 4312 KB Partially correct
27 Partially correct 64 ms 4356 KB Partially correct
28 Partially correct 66 ms 4176 KB Partially correct
29 Partially correct 70 ms 4236 KB Partially correct
30 Partially correct 28 ms 4184 KB Partially correct
31 Partially correct 0 ms 340 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct