oj.uz

답안 #1083431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083431 2024-09-03T06:03:35 Z dong_gas Gap (APIO16_gap) C++17
100 / 100
 49 ms 4256 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 = 1ll + (mx - 1 - mn - 1 + 1) / n, 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) {
            ret = max(ret, b[i].first - bef);
        }
        bef = b[i].second;
    }
    return ret;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 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 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 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 688 KB Output is correct
17 Correct 8 ms 856 KB Output is correct
18 Correct 6 ms 856 KB Output is correct
19 Correct 6 ms 688 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 25 ms 1912 KB Output is correct
22 Correct 25 ms 1880 KB Output is correct
23 Correct 26 ms 1984 KB Output is correct
24 Correct 25 ms 1880 KB Output is correct
25 Correct 28 ms 1880 KB Output is correct
26 Correct 26 ms 1872 KB Output is correct
27 Correct 26 ms 1880 KB Output is correct
28 Correct 26 ms 1880 KB Output is correct
29 Correct 26 ms 2004 KB Output is correct
30 Correct 22 ms 1876 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 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 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 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 9 ms 1368 KB Output is correct
17 Correct 9 ms 1368 KB Output is correct
18 Correct 9 ms 1344 KB Output is correct
19 Correct 9 ms 1368 KB Output is correct
20 Correct 5 ms 1356 KB Output is correct
21 Correct 38 ms 4184 KB Output is correct
22 Correct 49 ms 4256 KB Output is correct
23 Correct 36 ms 4144 KB Output is correct
24 Correct 39 ms 4176 KB Output is correct
25 Correct 34 ms 4184 KB Output is correct
26 Correct 43 ms 4184 KB Output is correct
27 Correct 39 ms 4176 KB Output is correct
28 Correct 38 ms 4176 KB Output is correct
29 Correct 39 ms 4176 KB Output is correct
30 Correct 25 ms 4184 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct