Submission #569728

# Submission time Handle Problem Language Result Execution time Memory
569728 2022-05-27T16:37:43 Z Rasoul006 Gap (APIO16_gap) C++17
0 / 100
47 ms 1960 KB
#include "gap.h"

#include <bits/stdc++.h>

#define endl "\n"

#define F first

#define S second

#define pb push_back

#define p push

#define mid (r+l)/2

#define lx n*2

#define rx n*2+1

typedef long long ll;

using namespace std;

const int S = 1e6+5;

const long long inf = 1e18;

long long findGap(int T, int N)
{
    long long a[N+9] , i = 0 , l = 0 , r = N-1 , mn = 0 , mx = 1e18+1 , ans = 0 - 1 ;

    while (i<N/2 + (N%2))
    {
        MinMax (mn + 1 , mx-1 , &mn , &mx);

        a[l] = mn ;
        a[r] = mx ;
        l++;
        r--;
        i++;
    }

    for (int j=0 ; j<N-1 ; j++)
    {
        ans = max(a[j+1] - a[j] , ans);
    }

	return ans ;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 11 ms 592 KB Output is correct
17 Correct 9 ms 592 KB Output is correct
18 Correct 13 ms 616 KB Output is correct
19 Correct 10 ms 628 KB Output is correct
20 Correct 8 ms 604 KB Output is correct
21 Correct 37 ms 1824 KB Output is correct
22 Correct 44 ms 1736 KB Output is correct
23 Correct 38 ms 1740 KB Output is correct
24 Correct 38 ms 1856 KB Output is correct
25 Correct 36 ms 1864 KB Output is correct
26 Correct 40 ms 1860 KB Output is correct
27 Correct 37 ms 1864 KB Output is correct
28 Correct 38 ms 1804 KB Output is correct
29 Correct 47 ms 1736 KB Output is correct
30 Correct 32 ms 1796 KB Output is correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Partially correct 0 ms 208 KB Partially correct
6 Partially correct 1 ms 208 KB Partially correct
7 Partially correct 0 ms 208 KB Partially correct
8 Partially correct 0 ms 208 KB Partially correct
9 Partially correct 0 ms 208 KB Partially correct
10 Partially correct 0 ms 208 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 320 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Partially correct 1 ms 336 KB Partially correct
16 Partially correct 10 ms 712 KB Partially correct
17 Partially correct 10 ms 592 KB Partially correct
18 Partially correct 9 ms 592 KB Partially correct
19 Partially correct 11 ms 684 KB Partially correct
20 Partially correct 10 ms 592 KB Partially correct
21 Incorrect 47 ms 1956 KB Expected int32, but "2500100000" found
22 Incorrect 36 ms 1908 KB Expected int32, but "2500100000" found
23 Incorrect 38 ms 1772 KB Expected int32, but "2500100000" found
24 Incorrect 40 ms 1856 KB Expected int32, but "2500100000" found
25 Incorrect 35 ms 1824 KB Expected int32, but "2500100000" found
26 Incorrect 37 ms 1960 KB Expected int32, but "2500100000" found
27 Incorrect 37 ms 1736 KB Expected int32, but "2500100000" found
28 Incorrect 38 ms 1868 KB Expected int32, but "2500100000" found
29 Incorrect 38 ms 1748 KB Expected int32, but "2500100000" found
30 Incorrect 32 ms 1828 KB Expected int32, but "2500100000" found
31 Incorrect 0 ms 208 KB Output isn't correct
32 Partially correct 0 ms 208 KB Partially correct