Submission #23024

# Submission time Handle Problem Language Result Execution time Memory
23024 2017-05-01T22:23:55 Z arman_ferdous Gap (APIO16_gap) C++14
100 / 100
79 ms 4900 KB
const long long MAXN = 1e18;
long long findGap(int, int);
void MinMax(long long , long long , long long *, long long *);
long long findGap(int T, int N)
{
    if(T == 2)
    {
        long long mmin, mmax;
        MinMax(0LL,MAXN,&mmin,&mmax);
        long long gap = (mmax-mmin-1)/(N-1), res = -1;
        long long L = mmin+1, prevMax = mmin;
        while(L<=mmax)
        {
            long long curMin, curMax;
            MinMax(L,L+gap,&curMin,&curMax);
            if(curMin != -1 && curMax != -1)
            {
                long long curDiff = curMin - prevMax;
                res = (curDiff > res ? curDiff : res);
                prevMax = curMax;
            }
            L += gap+1;
        }
        return res;
    }
    long long aray[N], i = 0, j = N-1, lo = 0, hi = MAXN;
    while(j-i >= 0)
    {
        long long x, y;
        MinMax(lo,hi,&x,&y);
        aray[i] = x, aray[j] = y;
        i++, j--;
        lo = x+1;
        hi = y-1;
    }

    long long res = -1;
    for(int i = 0; i+1 < N; i++)
        res = (res < aray[i+1]-aray[i] ? aray[i+1]-aray[i] : res);
    return res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Correct 0 ms 4240 KB Output is correct
3 Correct 0 ms 4240 KB Output is correct
4 Correct 0 ms 4240 KB Output is correct
5 Correct 0 ms 4240 KB Output is correct
6 Correct 0 ms 4240 KB Output is correct
7 Correct 0 ms 4240 KB Output is correct
8 Correct 0 ms 4240 KB Output is correct
9 Correct 0 ms 4240 KB Output is correct
10 Correct 0 ms 4240 KB Output is correct
11 Correct 0 ms 4240 KB Output is correct
12 Correct 0 ms 4240 KB Output is correct
13 Correct 0 ms 4240 KB Output is correct
14 Correct 0 ms 4240 KB Output is correct
15 Correct 0 ms 4240 KB Output is correct
16 Correct 13 ms 4312 KB Output is correct
17 Correct 16 ms 4308 KB Output is correct
18 Correct 13 ms 4308 KB Output is correct
19 Correct 13 ms 4308 KB Output is correct
20 Correct 6 ms 4308 KB Output is correct
21 Correct 56 ms 4896 KB Output is correct
22 Correct 53 ms 4896 KB Output is correct
23 Correct 59 ms 4900 KB Output is correct
24 Correct 43 ms 4896 KB Output is correct
25 Correct 43 ms 4896 KB Output is correct
26 Correct 49 ms 4900 KB Output is correct
27 Correct 63 ms 4896 KB Output is correct
28 Correct 56 ms 4896 KB Output is correct
29 Correct 49 ms 4896 KB Output is correct
30 Correct 46 ms 4896 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Correct 0 ms 4240 KB Output is correct
3 Correct 0 ms 4240 KB Output is correct
4 Correct 0 ms 4240 KB Output is correct
5 Correct 0 ms 4240 KB Output is correct
6 Correct 0 ms 4240 KB Output is correct
7 Correct 0 ms 4240 KB Output is correct
8 Correct 0 ms 4240 KB Output is correct
9 Correct 0 ms 4240 KB Output is correct
10 Correct 0 ms 4240 KB Output is correct
11 Correct 0 ms 4240 KB Output is correct
12 Correct 0 ms 4240 KB Output is correct
13 Correct 0 ms 4240 KB Output is correct
14 Correct 0 ms 4240 KB Output is correct
15 Correct 0 ms 4240 KB Output is correct
16 Correct 19 ms 4240 KB Output is correct
17 Correct 16 ms 4240 KB Output is correct
18 Correct 16 ms 4240 KB Output is correct
19 Correct 16 ms 4240 KB Output is correct
20 Correct 6 ms 4240 KB Output is correct
21 Correct 73 ms 4240 KB Output is correct
22 Correct 73 ms 4240 KB Output is correct
23 Correct 63 ms 4240 KB Output is correct
24 Correct 79 ms 4240 KB Output is correct
25 Correct 79 ms 4240 KB Output is correct
26 Correct 69 ms 4240 KB Output is correct
27 Correct 76 ms 4240 KB Output is correct
28 Correct 79 ms 4240 KB Output is correct
29 Correct 69 ms 4240 KB Output is correct
30 Correct 36 ms 4240 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct