#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)
using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,ll *,ll *);
//ll ar[12];
//void MinMax(ll s,ll e,ll *mn,ll *mx){
// *mn=-1;
// *mx=-1;
// for(int i=0;i<2;i++){
// if(s<=ar[i]&&ar[i]<=e){
// if(*mn!=-1)*mn=min(*mn,ar[i]);
// else *mn=ar[i];
// if(*mx!=-1)*mx=max(*mx,ar[i]);
// else *mx=ar[i];
// }
// }
//}
long long findGap(int ,int );
ll a[300006];
vector<pll> v[3];
vector<ll> arr;
long long findGap(int t,int n){
if(1){
ll l=0,r=1e18;
ll res=0;
ll i=0,j=n-1;
W(i<=j){
MinMax(l,r,&l,&r);
a[i]=l;
a[j]=r;
r--,l++;
i++,j--;
}
for(int i=1;i<n;i++)res=max(res,a[i]-a[i-1]);
R res;
}
}
//int main(){
// ar[0]=0;
// ar[1]=1;
// ar[2]=10;
// for(int i=3;i<10;i++)ar[i]=ar[i-1]*100;
// cout<<findGap(2,2);
//}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 2 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 3 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 4 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 5 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 6 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 7 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 8 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 9 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 10 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 11 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 12 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 13 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 14 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 15 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 16 |
Correct |
13 ms |
7488 KB |
Output is correct |
| 17 |
Correct |
13 ms |
7488 KB |
Output is correct |
| 18 |
Correct |
13 ms |
7488 KB |
Output is correct |
| 19 |
Correct |
13 ms |
7488 KB |
Output is correct |
| 20 |
Correct |
6 ms |
7488 KB |
Output is correct |
| 21 |
Correct |
56 ms |
7488 KB |
Output is correct |
| 22 |
Correct |
59 ms |
7488 KB |
Output is correct |
| 23 |
Correct |
53 ms |
7488 KB |
Output is correct |
| 24 |
Correct |
53 ms |
7488 KB |
Output is correct |
| 25 |
Correct |
46 ms |
7488 KB |
Output is correct |
| 26 |
Correct |
53 ms |
7488 KB |
Output is correct |
| 27 |
Correct |
53 ms |
7488 KB |
Output is correct |
| 28 |
Correct |
46 ms |
7488 KB |
Output is correct |
| 29 |
Correct |
66 ms |
7488 KB |
Output is correct |
| 30 |
Correct |
33 ms |
7488 KB |
Output is correct |
| 31 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 32 |
Correct |
0 ms |
7488 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
7488 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 11 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 13 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 16 |
Partially correct |
13 ms |
7488 KB |
Partially correct |
| 17 |
Partially correct |
13 ms |
7488 KB |
Partially correct |
| 18 |
Partially correct |
9 ms |
7488 KB |
Partially correct |
| 19 |
Partially correct |
16 ms |
7488 KB |
Partially correct |
| 20 |
Partially correct |
9 ms |
7488 KB |
Partially correct |
| 21 |
Incorrect |
49 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
59 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
56 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
49 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
49 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
56 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
56 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
53 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
56 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
43 ms |
7488 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
7488 KB |
Partially correct |
