Submission #953222

# Submission time Handle Problem Language Result Execution time Memory
953222 2024-03-25T17:39:38 Z n3rm1n Gap (APIO16_gap) C++17
78.5412 / 100
56 ms 3612 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 - 1)/n;
    //if(x * (n-1) < l)x ++;
    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
*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2644 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 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 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 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 2536 KB Output is correct
17 Correct 8 ms 2648 KB Output is correct
18 Correct 8 ms 2704 KB Output is correct
19 Correct 9 ms 2536 KB Output is correct
20 Correct 7 ms 2572 KB Output is correct
21 Correct 31 ms 3360 KB Output is correct
22 Correct 30 ms 3440 KB Output is correct
23 Correct 30 ms 3452 KB Output is correct
24 Correct 32 ms 3448 KB Output is correct
25 Correct 27 ms 3448 KB Output is correct
26 Correct 32 ms 3460 KB Output is correct
27 Correct 30 ms 3612 KB Output is correct
28 Correct 30 ms 3452 KB Output is correct
29 Correct 30 ms 3456 KB Output is correct
30 Correct 26 ms 3436 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory 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 1 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 1 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 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 11 ms 2540 KB Partially correct
17 Partially correct 12 ms 2548 KB Partially correct
18 Partially correct 11 ms 2536 KB Partially correct
19 Partially correct 11 ms 2664 KB Partially correct
20 Correct 6 ms 2788 KB Output is correct
21 Partially correct 48 ms 2916 KB Partially correct
22 Partially correct 50 ms 2672 KB Partially correct
23 Partially correct 45 ms 2932 KB Partially correct
24 Partially correct 45 ms 2680 KB Partially correct
25 Partially correct 56 ms 2680 KB Partially correct
26 Partially correct 45 ms 2680 KB Partially correct
27 Partially correct 44 ms 2680 KB Partially correct
28 Partially correct 45 ms 2688 KB Partially correct
29 Partially correct 45 ms 2792 KB Partially correct
30 Correct 22 ms 2676 KB Output is correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct