#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long a[100005];
//void MinMax(long long s, long long t, long long *mn, long long *mx);
long long findGap(int T, int N){
MinMax(0, 1LL<<60, &a[0], &a[N-1]);
for(int i = 1; i < (N+1)/2; i ++){
MinMax(a[i-1]+1, a[N-i]-1, &a[i], &a[N-i-1]);
}
long long ans = 0;
for(int i = 0; i < N-1; i ++){
//printf("%d %d\n", i, a[i]);
ans = max(ans, a[i+1]-a[i]);
}
return ans;
}
/*
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
int main()
{
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}
*/
| # |
결과 |
실행 시간 |
메모리 |
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 |
404 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 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 |
2 ms |
376 KB |
Output is correct |
| 16 |
Correct |
13 ms |
1144 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1144 KB |
Output is correct |
| 18 |
Correct |
13 ms |
1272 KB |
Output is correct |
| 19 |
Correct |
14 ms |
1272 KB |
Output is correct |
| 20 |
Correct |
10 ms |
860 KB |
Output is correct |
| 21 |
Correct |
48 ms |
3676 KB |
Output is correct |
| 22 |
Correct |
49 ms |
3704 KB |
Output is correct |
| 23 |
Correct |
49 ms |
3676 KB |
Output is correct |
| 24 |
Correct |
50 ms |
3832 KB |
Output is correct |
| 25 |
Correct |
40 ms |
3100 KB |
Output is correct |
| 26 |
Correct |
48 ms |
3772 KB |
Output is correct |
| 27 |
Correct |
49 ms |
3704 KB |
Output is correct |
| 28 |
Correct |
48 ms |
3676 KB |
Output is correct |
| 29 |
Correct |
48 ms |
3704 KB |
Output is correct |
| 30 |
Correct |
35 ms |
2552 KB |
Output is correct |
| 31 |
Correct |
2 ms |
380 KB |
Output is correct |
| 32 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 11 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 12 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 13 |
Partially correct |
2 ms |
372 KB |
Partially correct |
| 14 |
Partially correct |
3 ms |
376 KB |
Partially correct |
| 15 |
Partially correct |
2 ms |
376 KB |
Partially correct |
| 16 |
Partially correct |
13 ms |
1144 KB |
Partially correct |
| 17 |
Partially correct |
15 ms |
1144 KB |
Partially correct |
| 18 |
Partially correct |
13 ms |
1144 KB |
Partially correct |
| 19 |
Partially correct |
13 ms |
1144 KB |
Partially correct |
| 20 |
Partially correct |
10 ms |
888 KB |
Partially correct |
| 21 |
Incorrect |
49 ms |
3704 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
50 ms |
3704 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
47 ms |
3824 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
47 ms |
3676 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
40 ms |
3064 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
48 ms |
3704 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
47 ms |
3832 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
47 ms |
3708 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
49 ms |
3748 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
36 ms |
2552 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
2 ms |
292 KB |
Partially correct |
| 32 |
Partially correct |
2 ms |
376 KB |
Partially correct |
