oj.uz

답안 #23020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23020 2017-05-01T20:45:22 Z arman_ferdous Gap (APIO16_gap) C++14
0 / 100
 73 ms 4900 KB 
const long long MAXN = 1e18;
void MinMax(long long , long long , long long *, long long *);
long long findGap(int T, int N)
{
    long long aray[N], i = 0, j = N-1, lo = 0, hi = MAXN;
    while(j-i >= 1)
    {
        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;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Incorrect 0 ms 4240 KB Output isn't correct
3 Incorrect 0 ms 4240 KB Output isn't correct
4 Incorrect 0 ms 4240 KB Output isn't correct
5 Incorrect 0 ms 4240 KB Output isn't 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 4308 KB Output is correct
17 Correct 9 ms 4312 KB Output is correct
18 Correct 9 ms 4308 KB Output is correct
19 Correct 6 ms 4308 KB Output is correct
20 Correct 6 ms 4308 KB Output is correct
21 Correct 49 ms 4896 KB Output is correct
22 Correct 43 ms 4896 KB Output is correct
23 Correct 53 ms 4892 KB Output is correct
24 Correct 49 ms 4896 KB Output is correct
25 Correct 39 ms 4892 KB Output is correct
26 Correct 43 ms 4896 KB Output is correct
27 Correct 66 ms 4896 KB Output is correct
28 Correct 49 ms 4900 KB Output is correct
29 Correct 46 ms 4896 KB Output is correct
30 Correct 39 ms 4900 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Incorrect 0 ms 4240 KB Output isn't correct
3 Incorrect 0 ms 4240 KB Output isn't correct
4 Incorrect 0 ms 4240 KB Output isn't correct
5 Incorrect 0 ms 4240 KB Output isn't correct
6 Partially correct 0 ms 4240 KB Partially correct
7 Partially correct 0 ms 4240 KB Partially correct
8 Partially correct 0 ms 4240 KB Partially correct
9 Partially correct 0 ms 4240 KB Partially correct
10 Partially correct 0 ms 4240 KB Partially correct
11 Partially correct 0 ms 4240 KB Partially correct
12 Partially correct 0 ms 4240 KB Partially correct
13 Partially correct 0 ms 4240 KB Partially correct
14 Partially correct 0 ms 4240 KB Partially correct
15 Partially correct 0 ms 4240 KB Partially correct
16 Partially correct 9 ms 4308 KB Partially correct
17 Partially correct 9 ms 4312 KB Partially correct
18 Partially correct 16 ms 4308 KB Partially correct
19 Partially correct 13 ms 4308 KB Partially correct
20 Partially correct 9 ms 4312 KB Partially correct
21 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
22 Incorrect 63 ms 4896 KB Expected int32, but "2500100000" found
23 Incorrect 53 ms 4900 KB Expected int32, but "2500100000" found
24 Incorrect 46 ms 4896 KB Expected int32, but "2500100000" found
25 Incorrect 43 ms 4900 KB Expected int32, but "2500100000" found
26 Incorrect 73 ms 4900 KB Expected int32, but "2500100000" found
27 Incorrect 49 ms 4892 KB Expected int32, but "2500100000" found
28 Incorrect 59 ms 4900 KB Expected int32, but "2500100000" found
29 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
30 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 4240 KB Partially correct
32 Partially correct 0 ms 4240 KB Partially correct