# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
39598 |
2018-01-16T17:30:26 Z |
igzi |
Gap (APIO16_gap) |
C++11 |
|
59 ms |
5928 KB |
#include "gap.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll a[101010],a1,a2,i,hs;
long long findGap(int T, int N)
{
a[0]=-1;
a1=0;
a2=N+1;
a[N+1]=1000000000000000002;
for(i=1;i<=(N+1)/2;i++)
{
// cout<<"A";
MinMax(a[a1]+1,a[a2]-1,&a[a1+1],&a[a2-1]);
a1++;
a2--;
}
for(i=1;i<N;i++)
hs=max(hs,a[i+1]-a[i]);
// for(i=1;i<=N;i++)
// cout<<a[i]<<" ";
// cout<<"\n";
return hs;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5928 KB |
Output is correct |
2 |
Correct |
0 ms |
5928 KB |
Output is correct |
3 |
Correct |
0 ms |
5928 KB |
Output is correct |
4 |
Correct |
0 ms |
5928 KB |
Output is correct |
5 |
Correct |
0 ms |
5928 KB |
Output is correct |
6 |
Correct |
0 ms |
5928 KB |
Output is correct |
7 |
Correct |
0 ms |
5928 KB |
Output is correct |
8 |
Correct |
0 ms |
5928 KB |
Output is correct |
9 |
Correct |
0 ms |
5928 KB |
Output is correct |
10 |
Correct |
0 ms |
5928 KB |
Output is correct |
11 |
Correct |
0 ms |
5928 KB |
Output is correct |
12 |
Correct |
0 ms |
5928 KB |
Output is correct |
13 |
Correct |
0 ms |
5928 KB |
Output is correct |
14 |
Correct |
0 ms |
5928 KB |
Output is correct |
15 |
Correct |
0 ms |
5928 KB |
Output is correct |
16 |
Correct |
13 ms |
5928 KB |
Output is correct |
17 |
Correct |
13 ms |
5928 KB |
Output is correct |
18 |
Correct |
6 ms |
5928 KB |
Output is correct |
19 |
Correct |
13 ms |
5928 KB |
Output is correct |
20 |
Correct |
9 ms |
5928 KB |
Output is correct |
21 |
Correct |
49 ms |
5928 KB |
Output is correct |
22 |
Correct |
49 ms |
5928 KB |
Output is correct |
23 |
Correct |
53 ms |
5928 KB |
Output is correct |
24 |
Correct |
49 ms |
5928 KB |
Output is correct |
25 |
Correct |
49 ms |
5928 KB |
Output is correct |
26 |
Correct |
46 ms |
5928 KB |
Output is correct |
27 |
Correct |
53 ms |
5928 KB |
Output is correct |
28 |
Correct |
49 ms |
5928 KB |
Output is correct |
29 |
Correct |
49 ms |
5928 KB |
Output is correct |
30 |
Correct |
39 ms |
5928 KB |
Output is correct |
31 |
Correct |
0 ms |
5928 KB |
Output is correct |
32 |
Correct |
0 ms |
5928 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5928 KB |
Output is correct |
2 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
3 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
4 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
5 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
6 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
7 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
8 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
9 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
10 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
11 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
12 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
13 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
14 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
15 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
16 |
Partially correct |
13 ms |
5928 KB |
Partially correct |
17 |
Partially correct |
13 ms |
5928 KB |
Partially correct |
18 |
Partially correct |
9 ms |
5928 KB |
Partially correct |
19 |
Partially correct |
13 ms |
5928 KB |
Partially correct |
20 |
Partially correct |
9 ms |
5928 KB |
Partially correct |
21 |
Incorrect |
56 ms |
5928 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
43 ms |
5928 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
59 ms |
5928 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
56 ms |
5928 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
46 ms |
5928 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
53 ms |
5928 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
59 ms |
5928 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
53 ms |
5928 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
53 ms |
5928 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
39 ms |
5928 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
0 ms |
5928 KB |
Partially correct |
32 |
Partially correct |
0 ms |
5928 KB |
Partially correct |