#include "gap.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%d %lld",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define umax(a,b) a = max(a,b);
#define umin(a,b) a = min(a,b);
#define endi puts("");
#define eps 1e-12
const int n = 1e6+12,INF=1e9+7;
ll q[n];
long long findGap(int T, int N)
{
ll l = 1,r = 1e18,ql=1,qr=N;
while (qr-ql>=0){
ll mn,mx;
MinMax(l,r,&mn,&mx);
q[ql] = mn;
q[qr] = mx;
l = mn+1;
r = mx-1;
ql++;
qr--;
}
ll mx = 0;
for (int i=1;i<=N;++i){
umax(mx,q[i+1]-q[i]);
}
return mx;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
388 KB |
Output is correct |
| 6 |
Correct |
0 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
0 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
364 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct |
| 16 |
Correct |
11 ms |
748 KB |
Output is correct |
| 17 |
Correct |
11 ms |
748 KB |
Output is correct |
| 18 |
Correct |
11 ms |
748 KB |
Output is correct |
| 19 |
Correct |
13 ms |
764 KB |
Output is correct |
| 20 |
Correct |
8 ms |
748 KB |
Output is correct |
| 21 |
Correct |
42 ms |
1900 KB |
Output is correct |
| 22 |
Correct |
43 ms |
1900 KB |
Output is correct |
| 23 |
Correct |
46 ms |
2008 KB |
Output is correct |
| 24 |
Correct |
43 ms |
1916 KB |
Output is correct |
| 25 |
Correct |
41 ms |
1900 KB |
Output is correct |
| 26 |
Correct |
42 ms |
2020 KB |
Output is correct |
| 27 |
Correct |
43 ms |
1900 KB |
Output is correct |
| 28 |
Correct |
42 ms |
2044 KB |
Output is correct |
| 29 |
Correct |
48 ms |
1900 KB |
Output is correct |
| 30 |
Correct |
37 ms |
1916 KB |
Output is correct |
| 31 |
Correct |
1 ms |
364 KB |
Output is correct |
| 32 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
364 KB |
Partially correct |
| 4 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 5 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 6 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 7 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 10 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 16 |
Partially correct |
11 ms |
748 KB |
Partially correct |
| 17 |
Partially correct |
11 ms |
748 KB |
Partially correct |
| 18 |
Partially correct |
12 ms |
764 KB |
Partially correct |
| 19 |
Partially correct |
11 ms |
748 KB |
Partially correct |
| 20 |
Partially correct |
9 ms |
748 KB |
Partially correct |
| 21 |
Incorrect |
43 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
42 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
48 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
42 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
37 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
48 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
46 ms |
1928 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
46 ms |
2028 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
42 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
37 ms |
1900 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
1 ms |
364 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
364 KB |
Partially correct |
