#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include "gap.h"
// 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;
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
long long a[200005],tl,tr,l,r,mx;
// 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;
// }
long long findGap(int sub,int n){
long long l,r,last,mi,mx,sum,last1,k;
MinMax(1,1e18,&l,&r);
k=sum=(r-l+n-2)/(n-1);
last=l;
last1=l;
for(long long i=l;i+k<r;i+=k){
last1=i;
MinMax(i,i+k,&mi,&mx);
if(mi!=-1 and mx!=-1){
sum=max(sum,mi-last);
last=mx;
}
i++;
}
MinMax(last1,r,&mi,&mx);
if(mi!=-1 and mx!=-1){
sum=max(sum,mi-last);
}
return sum;
}
// int main()
// {
// cin>>N;
// for (int i=1;i<=N;i++) cin>>A[i];
// printf("%lld\n", findGap(subtask_num, N));
// printf("%lld\n", call_count);
// }
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
2500 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Incorrect |
7 ms |
2392 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
2516 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
2520 KB |
Output isn't correct |
| 19 |
Incorrect |
8 ms |
2480 KB |
Output isn't correct |
| 20 |
Incorrect |
4 ms |
2548 KB |
Output isn't correct |
| 21 |
Incorrect |
36 ms |
2688 KB |
Output isn't correct |
| 22 |
Incorrect |
34 ms |
2648 KB |
Output isn't correct |
| 23 |
Incorrect |
30 ms |
2648 KB |
Output isn't correct |
| 24 |
Incorrect |
35 ms |
2648 KB |
Output isn't correct |
| 25 |
Incorrect |
36 ms |
2560 KB |
Output isn't correct |
| 26 |
Incorrect |
40 ms |
2648 KB |
Output isn't correct |
| 27 |
Incorrect |
36 ms |
2648 KB |
Output isn't correct |
| 28 |
Incorrect |
30 ms |
2648 KB |
Output isn't correct |
| 29 |
Incorrect |
32 ms |
2672 KB |
Output isn't correct |
| 30 |
Incorrect |
17 ms |
2648 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 2 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Correct |
1 ms |
2500 KB |
Output is correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Correct |
8 ms |
2488 KB |
Output is correct |
| 17 |
Correct |
10 ms |
2392 KB |
Output is correct |
| 18 |
Partially correct |
9 ms |
2392 KB |
Partially correct |
| 19 |
Partially correct |
10 ms |
2392 KB |
Partially correct |
| 20 |
Correct |
6 ms |
2388 KB |
Output is correct |
| 21 |
Correct |
41 ms |
2648 KB |
Output is correct |
| 22 |
Correct |
31 ms |
2648 KB |
Output is correct |
| 23 |
Correct |
33 ms |
2648 KB |
Output is correct |
| 24 |
Correct |
30 ms |
2648 KB |
Output is correct |
| 25 |
Partially correct |
30 ms |
2648 KB |
Partially correct |
| 26 |
Partially correct |
38 ms |
2640 KB |
Partially correct |
| 27 |
Partially correct |
30 ms |
2648 KB |
Partially correct |
| 28 |
Correct |
38 ms |
2644 KB |
Output is correct |
| 29 |
Partially correct |
33 ms |
2600 KB |
Partially correct |
| 30 |
Correct |
21 ms |
2648 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
