답안 #931156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931156 2024-02-21T10:15:57 Z Amirreza_Fakhri Gap (APIO16_gap) C++17
100 / 100
45 ms 1992 KB
// In the name of the God

#include "gap.h"

#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

const int inf = 1e9+7;
const int mod = 998244353;
const ll maxn = 1e18;

ll a[100005];

ll findGap(int t, int n) {
    if (t == 1) {
        ll s = 0ll, e = maxn;
        for (ll l = 1, r = n; l <= r; l++, r--) {
            ll mn, mx;
            MinMax(s, e, &mn, &mx);
            a[l] = mn;
            a[r] = mx;
            s = mn + 1, e = mx - 1;
        }
        ll ans = 0;
        for (ll i = 2; i <= n; i++) smax(ans, a[i] - a[i-1]);
        return ans;
    }
    ll mn, mx;
    MinMax(0ll, maxn, &mn, &mx);
    ll g = (mx-mn+n-2)/(n-1);
    ll ans = g, l = mn;
    for (ll i = mn; i <= mx; i += g+1) {
        ll x, y;
        MinMax(i, min(i+g, mx), &x, &y);
        if (x != -1) smax(ans, x-l), l = y;
    }
    return ans;
}

// int32_t main() {
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     return 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 340 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 1 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 8 ms 904 KB Output is correct
17 Correct 7 ms 904 KB Output is correct
18 Correct 7 ms 652 KB Output is correct
19 Correct 7 ms 652 KB Output is correct
20 Correct 6 ms 620 KB Output is correct
21 Correct 29 ms 1964 KB Output is correct
22 Correct 34 ms 1984 KB Output is correct
23 Correct 29 ms 1972 KB Output is correct
24 Correct 29 ms 1984 KB Output is correct
25 Correct 29 ms 1992 KB Output is correct
26 Correct 29 ms 1784 KB Output is correct
27 Correct 29 ms 1984 KB Output is correct
28 Correct 28 ms 1992 KB Output is correct
29 Correct 29 ms 1976 KB Output is correct
30 Correct 25 ms 1936 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 10 ms 652 KB Output is correct
17 Correct 12 ms 656 KB Output is correct
18 Correct 11 ms 640 KB Output is correct
19 Correct 10 ms 644 KB Output is correct
20 Correct 6 ms 872 KB Output is correct
21 Correct 40 ms 1220 KB Output is correct
22 Correct 40 ms 1216 KB Output is correct
23 Correct 40 ms 1236 KB Output is correct
24 Correct 44 ms 1212 KB Output is correct
25 Correct 38 ms 1196 KB Output is correct
26 Correct 40 ms 1216 KB Output is correct
27 Correct 39 ms 1220 KB Output is correct
28 Correct 41 ms 1220 KB Output is correct
29 Correct 45 ms 1216 KB Output is correct
30 Correct 22 ms 1180 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct