Submission #106762

# Submission time Handle Problem Language Result Execution time Memory
106762 2019-04-20T10:20:40 Z brcode Gap (APIO16_gap) C++14
30 / 100
69 ms 3732 KB
#include <iostream>
#include "gap.h"
using namespace std;
const int MAXN = 1e6+5;
long long arr[MAXN];
long long findGap(int T,int N){
    long long a = 1;
    long long b = 1e18;
    long long l = 0;
    long long r = N-1;
    long long mn,mx;
    long long total = 0;
    while(total<N){
        MinMax(a, b, &mn, &mx);
        arr[l] = mn;
        arr[r] = mx;
        l++;
        r--;
        total+=2;
        a = mn+1;
        b = mx-1;
    }
    long long diff = 0;
    for(long long i=0;i<N-1;i++){
        diff = max(diff,arr[i+1]-arr[i]);
    }
    return diff;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 360 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 15 ms 1152 KB Output is correct
17 Correct 14 ms 1152 KB Output is correct
18 Correct 15 ms 1152 KB Output is correct
19 Correct 15 ms 1152 KB Output is correct
20 Correct 12 ms 1024 KB Output is correct
21 Correct 56 ms 3636 KB Output is correct
22 Correct 56 ms 3704 KB Output is correct
23 Correct 56 ms 3704 KB Output is correct
24 Correct 61 ms 3704 KB Output is correct
25 Correct 51 ms 3064 KB Output is correct
26 Correct 61 ms 3724 KB Output is correct
27 Correct 65 ms 3732 KB Output is correct
28 Correct 69 ms 3704 KB Output is correct
29 Correct 61 ms 3720 KB Output is correct
30 Correct 46 ms 2552 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Partially correct 2 ms 384 KB Partially correct
3 Partially correct 2 ms 384 KB Partially correct
4 Partially correct 3 ms 384 KB Partially correct
5 Partially correct 2 ms 384 KB Partially correct
6 Partially correct 3 ms 384 KB Partially correct
7 Partially correct 2 ms 384 KB Partially correct
8 Partially correct 2 ms 384 KB Partially correct
9 Partially correct 3 ms 384 KB Partially correct
10 Partially correct 2 ms 384 KB Partially correct
11 Partially correct 2 ms 384 KB Partially correct
12 Partially correct 2 ms 384 KB Partially correct
13 Partially correct 2 ms 512 KB Partially correct
14 Partially correct 3 ms 384 KB Partially correct
15 Partially correct 3 ms 384 KB Partially correct
16 Partially correct 14 ms 1152 KB Partially correct
17 Partially correct 15 ms 1152 KB Partially correct
18 Partially correct 16 ms 1152 KB Partially correct
19 Partially correct 17 ms 1152 KB Partially correct
20 Partially correct 13 ms 768 KB Partially correct
21 Incorrect 56 ms 3680 KB Expected int32, but "2500100000" found
22 Incorrect 52 ms 3704 KB Expected int32, but "2500100000" found
23 Incorrect 65 ms 3700 KB Expected int32, but "2500100000" found
24 Incorrect 53 ms 3704 KB Expected int32, but "2500100000" found
25 Incorrect 44 ms 3064 KB Expected int32, but "2500100000" found
26 Incorrect 55 ms 3704 KB Expected int32, but "2500100000" found
27 Incorrect 54 ms 3628 KB Expected int32, but "2500100000" found
28 Incorrect 55 ms 3704 KB Expected int32, but "2500100000" found
29 Incorrect 56 ms 3708 KB Expected int32, but "2500100000" found
30 Incorrect 39 ms 2552 KB Expected int32, but "2500100000" found
31 Partially correct 3 ms 384 KB Partially correct
32 Partially correct 3 ms 384 KB Partially correct