#include<bits/stdc++.h>
#ifndef LOCAL
#include "gap.h"
#endif
#define ll long long
using namespace std;
#ifdef LOCAL
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;
}
#endif // LOCAL
set<ll> st;
const ll INF = 1e18;
mt19937_64 rnd(51);
long long findGap(int t, int n) {
ll a, b;
MinMax(0, INF, &a, &b);
ll len = (b - a + 1) / (n - 1), now = a + 1, last = a, ans = 0;
for (int i = 0; i < n; i++) {
ll mn, mx;
MinMax(now, now + len - 1, &mn, &mx);
if (mn != -1) {
if (last != -1) {
ans = max(ans, mn - last);
}
last = mx;
}
now += len;
}
return ans;
}
#ifdef LOCAL
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);
}
#endif
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
208 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
14 ms |
428 KB |
Output isn't correct |
| 17 |
Incorrect |
14 ms |
448 KB |
Output isn't correct |
| 18 |
Incorrect |
14 ms |
516 KB |
Output isn't correct |
| 19 |
Incorrect |
13 ms |
464 KB |
Output isn't correct |
| 20 |
Incorrect |
7 ms |
464 KB |
Output isn't correct |
| 21 |
Incorrect |
56 ms |
1056 KB |
Output isn't correct |
| 22 |
Incorrect |
56 ms |
1084 KB |
Output isn't correct |
| 23 |
Incorrect |
56 ms |
1084 KB |
Output isn't correct |
| 24 |
Incorrect |
59 ms |
1084 KB |
Output isn't correct |
| 25 |
Incorrect |
50 ms |
968 KB |
Output isn't correct |
| 26 |
Incorrect |
60 ms |
1096 KB |
Output isn't correct |
| 27 |
Incorrect |
53 ms |
1060 KB |
Output isn't correct |
| 28 |
Incorrect |
56 ms |
1056 KB |
Output isn't correct |
| 29 |
Incorrect |
56 ms |
1064 KB |
Output isn't correct |
| 30 |
Incorrect |
27 ms |
1064 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
208 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
13 ms |
432 KB |
Output is correct |
| 17 |
Correct |
14 ms |
464 KB |
Output is correct |
| 18 |
Correct |
17 ms |
464 KB |
Output is correct |
| 19 |
Correct |
13 ms |
464 KB |
Output is correct |
| 20 |
Incorrect |
6 ms |
464 KB |
Output isn't correct |
| 21 |
Correct |
54 ms |
1084 KB |
Output is correct |
| 22 |
Correct |
54 ms |
968 KB |
Output is correct |
| 23 |
Correct |
60 ms |
1096 KB |
Output is correct |
| 24 |
Correct |
58 ms |
968 KB |
Output is correct |
| 25 |
Correct |
48 ms |
1080 KB |
Output is correct |
| 26 |
Correct |
54 ms |
1084 KB |
Output is correct |
| 27 |
Correct |
53 ms |
1088 KB |
Output is correct |
| 28 |
Correct |
60 ms |
1104 KB |
Output is correct |
| 29 |
Correct |
58 ms |
1048 KB |
Output is correct |
| 30 |
Incorrect |
27 ms |
964 KB |
Output isn't correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
