# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
39605 |
2018-01-16T17:47:19 Z |
igzi |
Gap (APIO16_gap) |
C++11 |
|
63 ms |
5800 KB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int t,int n){
long long l=0,d=n+1,a[100005],m=0,i;
for(i=0;i<n;i++){
a[i]=-5;
}
a[0]=-1;
a[n+1]=1000000000000000005;
for(i=1;i<=(n+1)/2;i++){
MinMax(a[l]+1,a[d]-1,&a[l+1],&a[d-1]);
l++; d--;
}
for(i=2;i<l;i++){
m=max(m,a[i]-a[i-1]);
}
for(i=d+1;i<n+1;i++){
m=max(m,a[i]-a[i-1]);
}
return m;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
5800 KB |
Output isn't correct |
2 |
Correct |
0 ms |
5796 KB |
Output is correct |
3 |
Correct |
0 ms |
5792 KB |
Output is correct |
4 |
Correct |
0 ms |
5796 KB |
Output is correct |
5 |
Correct |
0 ms |
5796 KB |
Output is correct |
6 |
Correct |
0 ms |
5800 KB |
Output is correct |
7 |
Correct |
0 ms |
5796 KB |
Output is correct |
8 |
Correct |
0 ms |
5792 KB |
Output is correct |
9 |
Correct |
0 ms |
5796 KB |
Output is correct |
10 |
Correct |
0 ms |
5796 KB |
Output is correct |
11 |
Correct |
0 ms |
5792 KB |
Output is correct |
12 |
Correct |
0 ms |
5796 KB |
Output is correct |
13 |
Correct |
0 ms |
5800 KB |
Output is correct |
14 |
Correct |
0 ms |
5792 KB |
Output is correct |
15 |
Correct |
0 ms |
5800 KB |
Output is correct |
16 |
Correct |
9 ms |
5796 KB |
Output is correct |
17 |
Correct |
13 ms |
5792 KB |
Output is correct |
18 |
Correct |
13 ms |
5792 KB |
Output is correct |
19 |
Correct |
13 ms |
5800 KB |
Output is correct |
20 |
Correct |
9 ms |
5796 KB |
Output is correct |
21 |
Correct |
63 ms |
5792 KB |
Output is correct |
22 |
Correct |
53 ms |
5796 KB |
Output is correct |
23 |
Correct |
63 ms |
5796 KB |
Output is correct |
24 |
Correct |
49 ms |
5796 KB |
Output is correct |
25 |
Correct |
53 ms |
5796 KB |
Output is correct |
26 |
Correct |
53 ms |
5796 KB |
Output is correct |
27 |
Correct |
46 ms |
5800 KB |
Output is correct |
28 |
Correct |
53 ms |
5800 KB |
Output is correct |
29 |
Correct |
46 ms |
5796 KB |
Output is correct |
30 |
Correct |
36 ms |
5792 KB |
Output is correct |
31 |
Correct |
0 ms |
5792 KB |
Output is correct |
32 |
Correct |
0 ms |
5796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
5800 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
5800 KB |
Output isn't correct |
3 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
4 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
5 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
6 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
7 |
Partially correct |
0 ms |
5792 KB |
Partially correct |
8 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
9 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
10 |
Partially correct |
0 ms |
5792 KB |
Partially correct |
11 |
Partially correct |
0 ms |
5800 KB |
Partially correct |
12 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
13 |
Partially correct |
0 ms |
5800 KB |
Partially correct |
14 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
15 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
16 |
Partially correct |
13 ms |
5796 KB |
Partially correct |
17 |
Partially correct |
13 ms |
5800 KB |
Partially correct |
18 |
Partially correct |
9 ms |
5796 KB |
Partially correct |
19 |
Partially correct |
13 ms |
5796 KB |
Partially correct |
20 |
Partially correct |
9 ms |
5796 KB |
Partially correct |
21 |
Incorrect |
53 ms |
5796 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
63 ms |
5796 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
56 ms |
5796 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
46 ms |
5800 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
43 ms |
5792 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
53 ms |
5792 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
49 ms |
5792 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
56 ms |
5792 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
53 ms |
5800 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
33 ms |
5800 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
0 ms |
5796 KB |
Partially correct |
32 |
Partially correct |
0 ms |
5796 KB |
Partially correct |