Submission #1083404

# Submission time Handle Problem Language Result Execution time Memory
1083404 2024-09-03T05:01:19 Z dong_gas Gap (APIO16_gap) C++17
66.4577 / 100
69 ms 4360 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 || n==2) {
        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;
    ll gap = (mx - mn + 1) / (n-1);
    for (ll i = a[1], cnt = 1; cnt < n; i += gap, cnt++) {
        l[cnt] = i, r[cnt] = i + gap - 1;
        if (cnt + 1 == n) r[cnt] = a[n];
    }
    bool full = true;
    for (int i = 1; i <= n; i++) {
        MinMax(l[i], r[i], &mn, &mx);
        b[i] = {mn, mx};
        if (mn == -1) full = false;
    }
    if (full) {
        for (int i = 2; i < n; i++) {
            ret = max(ret, b[i].first - b[i - 1].first);
        }
    } else {
        for (int i = 2; i < n; i++) {
            if (b[i - 1].first == -1 || b[i].first == -1) continue;
            ret = max(ret, b[i].first - b[i - 1].second);
        }
        ll bef = -1;
        for (int i = 1; i < n; 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 340 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 500 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 7 ms 836 KB Output is correct
18 Correct 8 ms 844 KB Output is correct
19 Correct 9 ms 856 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 25 ms 1828 KB Output is correct
22 Correct 26 ms 1880 KB Output is correct
23 Correct 26 ms 1872 KB Output is correct
24 Correct 31 ms 1880 KB Output is correct
25 Correct 24 ms 1880 KB Output is correct
26 Correct 25 ms 1880 KB Output is correct
27 Correct 36 ms 1872 KB Output is correct
28 Correct 33 ms 1880 KB Output is correct
29 Correct 25 ms 1880 KB Output is correct
30 Correct 21 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 1 ms 340 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Partially correct 1 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 18 ms 1372 KB Partially correct
17 Partially correct 16 ms 1368 KB Partially correct
18 Partially correct 14 ms 1368 KB Partially correct
19 Partially correct 16 ms 1368 KB Partially correct
20 Partially correct 9 ms 1368 KB Partially correct
21 Partially correct 57 ms 4116 KB Partially correct
22 Partially correct 55 ms 4176 KB Partially correct
23 Partially correct 56 ms 4176 KB Partially correct
24 Partially correct 55 ms 4172 KB Partially correct
25 Partially correct 60 ms 4248 KB Partially correct
26 Partially correct 69 ms 4360 KB Partially correct
27 Partially correct 66 ms 4152 KB Partially correct
28 Partially correct 56 ms 4176 KB Partially correct
29 Partially correct 57 ms 4360 KB Partially correct
30 Partially correct 24 ms 4168 KB Partially correct
31 Partially correct 1 ms 344 KB Partially correct
32 Partially correct 1 ms 344 KB Partially correct