oj.uz

답안 #952512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952512 2024-03-24T07:24:53 Z n3rm1n Gap (APIO16_gap) C++17
86.3068 / 100
 58 ms 3456 KB 
#include<bits/stdc++.h>
#include "gap.h"

using namespace std;
const long long MAXN = 2e5 + 10;
long long a[MAXN];
long long findGap(int T, int N)
{
    if(T == 1)
    {
        long long s = 0, t = (long long)(1e18);
        long long mn, mx;
        long long n = N;
        long long filled0 = 0, filled1 = n+1;

        while(filled0 + 1 <= filled1 - 1)
        {

            MinMax(s, t, &mn, &mx);

            if(mn == mx)
            {
                filled0 ++;
                a[filled0] = mn;
                n --;
                break;
            }
            filled0 ++;
            filled1 --;
            n-= 2;
            a[filled0] = mn;
            a[filled1] = mx;

            s = mn + 1;
            t = mx - 1;
        }
        long long ans = -1;
        for (long long i = 2; i <= N; ++ i)
            ans = max(ans, (long long) (a[i] - a[i-1]));
        return ans;
    }
    long long n = N;
    long long s = 0, t = (long long)(1e18);
    long long mn, mx;
    long long range_l = 0, range_r;
    long long l;
    MinMax(s, t, &mn, &mx);
    range_l = mn;
    range_r = mx;
    l = range_r - range_l + 1;
    long long x = (l + n - 2)/(n -1);

    long long last = range_l, cache = 0;
    long long st = last;
    long long ans = 0;
    while(last < range_r)
    {

        s = last + 1;
        t = last + x + 1;
        MinMax(s, t, &mn, &mx);

        if(mx != -1 && mn > last && (mn >= s && mn <= t) && (mx >= s && mx <= t))
        {
            ans = max(ans, mn - st);
            last = mx;
            st = last;
        }
        else
        {
            cache += x;
            last = last + x + 1;
        }
    }
    return ans;
}
/**
2 5
2 3 7 17 19
*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2400 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 3 ms 2392 KB Output is correct
14 Correct 2 ms 2552 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2540 KB Output is correct
17 Correct 11 ms 2708 KB Output is correct
18 Correct 8 ms 2704 KB Output is correct
19 Correct 8 ms 2544 KB Output is correct
20 Correct 9 ms 2536 KB Output is correct
21 Correct 38 ms 3212 KB Output is correct
22 Correct 30 ms 3228 KB Output is correct
23 Correct 31 ms 3456 KB Output is correct
24 Correct 30 ms 3448 KB Output is correct
25 Correct 33 ms 3364 KB Output is correct
26 Correct 34 ms 3268 KB Output is correct
27 Correct 40 ms 3408 KB Output is correct
28 Correct 30 ms 3248 KB Output is correct
29 Correct 31 ms 3348 KB Output is correct
30 Correct 29 ms 3428 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
56.3067756363 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Correct 1 ms 2392 KB Output is correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2388 KB Partially correct
9 Partially correct 1 ms 2400 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 2 ms 2640 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Correct 1 ms 2392 KB Output is correct
16 Partially correct 11 ms 2540 KB Partially correct
17 Partially correct 16 ms 2536 KB Partially correct
18 Partially correct 12 ms 2540 KB Partially correct
19 Partially correct 14 ms 2540 KB Partially correct
20 Correct 6 ms 2536 KB Output is correct
21 Partially correct 58 ms 2680 KB Partially correct
22 Partially correct 52 ms 2648 KB Partially correct
23 Partially correct 51 ms 2684 KB Partially correct
24 Partially correct 46 ms 2684 KB Partially correct
25 Correct 39 ms 2676 KB Output is correct
26 Partially correct 57 ms 2680 KB Partially correct
27 Partially correct 46 ms 2804 KB Partially correct
28 Partially correct 46 ms 2680 KB Partially correct
29 Partially correct 45 ms 2636 KB Partially correct
30 Correct 27 ms 2676 KB Output is correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct