답안 #931139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931139 2024-02-21T10:01:04 Z Amirreza_Fakhri Gap (APIO16_gap) C++17
30 / 100
35 ms 2060 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 j = 0;
        ll l = 1, r = maxn;
        ll mn, mx;
        vector<ll> v;
        for (ll i = 0; i < (n + 1) / 2; i++) {
            MinMax(l, r, &mn, &mx);
            a[j++] = mn;
            a[j++] = mx;
            l = mn + 1, r = mx - 1;
        }
        sort(a, a + n);
        ll ans = 0;
        for (ll i = 0; i < n - 1; i++) ans = max(ans, a[i + 1] - a[i]);
        return ans;
    }
    return 1ll;
}

// 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 596 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 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 836 KB Output is correct
17 Correct 8 ms 620 KB Output is correct
18 Correct 8 ms 648 KB Output is correct
19 Correct 8 ms 788 KB Output is correct
20 Correct 7 ms 620 KB Output is correct
21 Correct 35 ms 1988 KB Output is correct
22 Correct 34 ms 1976 KB Output is correct
23 Correct 31 ms 1976 KB Output is correct
24 Correct 31 ms 2000 KB Output is correct
25 Correct 29 ms 1936 KB Output is correct
26 Correct 31 ms 2060 KB Output is correct
27 Correct 31 ms 1988 KB Output is correct
28 Correct 33 ms 1996 KB Output is correct
29 Correct 31 ms 1980 KB Output is correct
30 Correct 27 ms 1916 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 1 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Incorrect 0 ms 344 KB Output isn't correct
16 Incorrect 3 ms 808 KB Output isn't correct
17 Incorrect 3 ms 644 KB Output isn't correct
18 Incorrect 4 ms 640 KB Output isn't correct
19 Incorrect 4 ms 720 KB Output isn't correct
20 Incorrect 3 ms 804 KB Output isn't correct
21 Incorrect 12 ms 1224 KB Output isn't correct
22 Incorrect 12 ms 1220 KB Output isn't correct
23 Incorrect 13 ms 1204 KB Output isn't correct
24 Incorrect 14 ms 1232 KB Output isn't correct
25 Incorrect 9 ms 1200 KB Output isn't correct
26 Incorrect 12 ms 1220 KB Output isn't correct
27 Incorrect 12 ms 1236 KB Output isn't correct
28 Incorrect 12 ms 1224 KB Output isn't correct
29 Incorrect 12 ms 1212 KB Output isn't correct
30 Incorrect 8 ms 1180 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct