Submission #182419

# Submission time Handle Problem Language Result Execution time Memory
182419 2020-01-09T18:54:03 Z AQT Gap (APIO16_gap) C++14
30 / 100
73 ms 2040 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

long long arr[100005];

long long findGap(int T, int N){
    if(T == 1){
        int l = 1, r = N;
        long long lstl = -1, lstr = 1000000000000000001LL;
        while(l <= r){
            MinMax(lstl+1, lstr-1, &lstl, &lstr);
            arr[l++] = lstl, arr[r--] = lstr;
        }
        long long ans = 0;
        for(int i = 2; i<=N; i++){
            ans = max(ans, arr[i]-arr[i-1]);
        }
        return ans;
    }
    fill(arr+1, arr+1+N, -1);
    long long s, e;
    MinMax(0, 1000000000000000000LL, &s, &e);
    long long d = (e-s)/(N-1);
    arr[1] = s, arr[N] = e;
    long long lst = s;
    long long ans = 0;
    long long n = s;
    while(n < e){
        long long t;
        MinMax(n+1, n+d, &s, &t);
        ans = max(ans, s-lst);
        lst = t;
        n += d;
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 372 KB Output is correct
16 Correct 15 ms 732 KB Output is correct
17 Correct 15 ms 764 KB Output is correct
18 Correct 15 ms 760 KB Output is correct
19 Correct 15 ms 732 KB Output is correct
20 Correct 12 ms 760 KB Output is correct
21 Correct 57 ms 1912 KB Output is correct
22 Correct 55 ms 1912 KB Output is correct
23 Correct 57 ms 1884 KB Output is correct
24 Correct 56 ms 1884 KB Output is correct
25 Correct 48 ms 1912 KB Output is correct
26 Correct 56 ms 1884 KB Output is correct
27 Correct 55 ms 1912 KB Output is correct
28 Correct 55 ms 1912 KB Output is correct
29 Correct 55 ms 1912 KB Output is correct
30 Correct 41 ms 1912 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Incorrect 2 ms 380 KB Output isn't correct
10 Incorrect 2 ms 380 KB Output isn't correct
11 Incorrect 3 ms 504 KB Output isn't correct
12 Incorrect 3 ms 376 KB Output isn't correct
13 Incorrect 3 ms 376 KB Output isn't correct
14 Incorrect 3 ms 376 KB Output isn't correct
15 Correct 3 ms 376 KB Output is correct
16 Incorrect 19 ms 760 KB Output isn't correct
17 Incorrect 19 ms 760 KB Output isn't correct
18 Incorrect 19 ms 760 KB Output isn't correct
19 Incorrect 19 ms 732 KB Output isn't correct
20 Incorrect 10 ms 760 KB Output isn't correct
21 Incorrect 73 ms 1884 KB Output isn't correct
22 Incorrect 73 ms 1912 KB Output isn't correct
23 Incorrect 73 ms 1912 KB Output isn't correct
24 Incorrect 73 ms 2012 KB Output isn't correct
25 Correct 70 ms 2040 KB Output is correct
26 Incorrect 73 ms 1980 KB Output isn't correct
27 Incorrect 73 ms 1912 KB Output isn't correct
28 Incorrect 73 ms 1940 KB Output isn't correct
29 Incorrect 73 ms 1912 KB Output isn't correct
30 Incorrect 40 ms 1912 KB Output isn't correct
31 Incorrect 2 ms 376 KB Output isn't correct
32 Incorrect 2 ms 376 KB Output isn't correct