#include <bits/stdc++.h>
#ifndef HOME
#include "gap.h"
#else
long long findGap(int, int);
namespace grader {
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;
}
void grader() {
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, "Gap : %lld\n", findGap(subtask_num, N));
fprintf(out, "Calls: %lld\n", call_count);
}
}
void MinMax(long long s, long long t, long long *mn, long long *mx) {
grader::MinMax(s, t, mn, mx);
}
int main()
{
grader::grader();
}
#endif
const int MAX_N = 100000;
const long long INF = 1000000000000000000;
long long v[MAX_N];
long long findGap(int T, int N) {
if(T == 1) {
long long rez = 0LL;
MinMax(0, INF, &v[0], &v[N - 1]);
for(int i = 1; i <= (N - 1) / 2; ++i)
MinMax(v[i - 1] + 1, v[N - i] - 1, &v[i], &v[N - i - 1]);
for(int i = 0; i < N - 1; ++i)
if(v[i + 1] - v[i] > rez)
rez = v[i + 1] - v[i];
return rez;
}
return 0LL;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
388 KB |
Output is correct |
| 3 |
Correct |
2 ms |
564 KB |
Output is correct |
| 4 |
Correct |
2 ms |
564 KB |
Output is correct |
| 5 |
Correct |
2 ms |
564 KB |
Output is correct |
| 6 |
Correct |
2 ms |
564 KB |
Output is correct |
| 7 |
Correct |
2 ms |
564 KB |
Output is correct |
| 8 |
Correct |
2 ms |
564 KB |
Output is correct |
| 9 |
Correct |
2 ms |
780 KB |
Output is correct |
| 10 |
Correct |
2 ms |
780 KB |
Output is correct |
| 11 |
Correct |
3 ms |
780 KB |
Output is correct |
| 12 |
Correct |
3 ms |
780 KB |
Output is correct |
| 13 |
Correct |
3 ms |
780 KB |
Output is correct |
| 14 |
Correct |
3 ms |
788 KB |
Output is correct |
| 15 |
Correct |
3 ms |
816 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1540 KB |
Output is correct |
| 17 |
Correct |
15 ms |
2028 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2476 KB |
Output is correct |
| 19 |
Correct |
18 ms |
2956 KB |
Output is correct |
| 20 |
Correct |
12 ms |
3192 KB |
Output is correct |
| 21 |
Correct |
76 ms |
6164 KB |
Output is correct |
| 22 |
Correct |
56 ms |
8008 KB |
Output is correct |
| 23 |
Correct |
65 ms |
9852 KB |
Output is correct |
| 24 |
Correct |
59 ms |
11696 KB |
Output is correct |
| 25 |
Correct |
49 ms |
12900 KB |
Output is correct |
| 26 |
Correct |
60 ms |
14756 KB |
Output is correct |
| 27 |
Correct |
61 ms |
16744 KB |
Output is correct |
| 28 |
Correct |
59 ms |
18460 KB |
Output is correct |
| 29 |
Correct |
54 ms |
20364 KB |
Output is correct |
| 30 |
Correct |
44 ms |
21012 KB |
Output is correct |
| 31 |
Correct |
2 ms |
21012 KB |
Output is correct |
| 32 |
Correct |
2 ms |
21012 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
21012 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
21012 KB |
Output isn't correct |
| 16 |
Incorrect |
9 ms |
21012 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
21012 KB |
Output isn't correct |
| 18 |
Incorrect |
14 ms |
21280 KB |
Output isn't correct |
| 19 |
Incorrect |
10 ms |
21716 KB |
Output isn't correct |
| 20 |
Incorrect |
6 ms |
21836 KB |
Output isn't correct |
| 21 |
Incorrect |
31 ms |
24396 KB |
Output isn't correct |
| 22 |
Incorrect |
31 ms |
26172 KB |
Output isn't correct |
| 23 |
Incorrect |
36 ms |
28032 KB |
Output isn't correct |
| 24 |
Incorrect |
32 ms |
29876 KB |
Output isn't correct |
| 25 |
Incorrect |
24 ms |
31080 KB |
Output isn't correct |
| 26 |
Incorrect |
31 ms |
32956 KB |
Output isn't correct |
| 27 |
Incorrect |
31 ms |
34796 KB |
Output isn't correct |
| 28 |
Incorrect |
30 ms |
36640 KB |
Output isn't correct |
| 29 |
Incorrect |
32 ms |
38484 KB |
Output isn't correct |
| 30 |
Incorrect |
18 ms |
39176 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
39176 KB |
Output isn't correct |
| 32 |
Incorrect |
2 ms |
39176 KB |
Output isn't correct |
