#include<bits/stdc++.h>
#include "gap.h"
using namespace std ;
#define maxn 200009
#define ll long long
#define pb push_back
#define fi first
#define se second
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<pii> vii ;
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void add ( int &a , int b )
{
a += b ;
if ( a >= mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
ll findGap ( int type , int n )
{
if ( type == 1 )
{
vector<ll> a (n+1) ;
ll s = 0 , t = 1e18 ;
for ( int l = 0 , r = n-1 ; l <= r ; ++ l , -- r )
{
MinMax (s,t,&a[l],&a[r]) ;
s = a [l] + 1 , t = a [r] - 1 ;
}
ll res = 0 ;
for ( int i = 1 ; i < n ; i ++ ) chkmax (res,a[i]-a[i-1]) ;
return res ;
}
}
//int main ()
//{
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
// rf () ;
//}
Compilation message
gap.cpp: In function 'void rf()':
gap.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | freopen ("bai1.inp","r",stdin) ;
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
58 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2640 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 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 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2580 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 18 |
Correct |
7 ms |
2696 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2576 KB |
Output is correct |
| 21 |
Correct |
29 ms |
3620 KB |
Output is correct |
| 22 |
Correct |
29 ms |
3624 KB |
Output is correct |
| 23 |
Correct |
28 ms |
3624 KB |
Output is correct |
| 24 |
Correct |
35 ms |
3620 KB |
Output is correct |
| 25 |
Correct |
25 ms |
3620 KB |
Output is correct |
| 26 |
Correct |
28 ms |
3628 KB |
Output is correct |
| 27 |
Correct |
29 ms |
3428 KB |
Output is correct |
| 28 |
Correct |
28 ms |
3616 KB |
Output is correct |
| 29 |
Correct |
28 ms |
3620 KB |
Output is correct |
| 30 |
Correct |
27 ms |
3616 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 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 |
Partially correct |
1 ms |
2644 KB |
Partially correct |
| 7 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
2644 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2504 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
7 ms |
2576 KB |
Partially correct |
| 17 |
Partially correct |
8 ms |
2588 KB |
Partially correct |
| 18 |
Partially correct |
7 ms |
2584 KB |
Partially correct |
| 19 |
Partially correct |
7 ms |
2656 KB |
Partially correct |
| 20 |
Partially correct |
6 ms |
2568 KB |
Partially correct |
| 21 |
Incorrect |
28 ms |
3628 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
28 ms |
3624 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
28 ms |
3620 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
28 ms |
3624 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
25 ms |
3620 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
29 ms |
3616 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
29 ms |
3624 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
29 ms |
3792 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
28 ms |
3624 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
23 ms |
3624 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
