# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
931005 |
2024-02-21T04:15:51 Z |
thunopro |
Gap (APIO16_gap) |
C++14 |
|
42 ms |
3792 KB |
#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 ;
}
else
{
ll mn , mx ;
MinMax (0,1e18,&mn,&mx) ;
ll ms = ( mx-mn+n-2 ) / (n-1) ;
ll res = ms , last = mn ;
for ( ll x = mn+1 ; x <= mx ; x += ms+1 )
{
ll a , b ;
MinMax (x,x+ms,&a,&b) ;
if ( a >= 0 ) chkmax (res,a-last) , last = b ;
}
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) ;
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
2392 KB |
Output is correct |
3 |
Correct |
0 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 |
2392 KB |
Output is correct |
9 |
Correct |
1 ms |
2496 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 |
7 ms |
2580 KB |
Output is correct |
17 |
Correct |
7 ms |
2588 KB |
Output is correct |
18 |
Correct |
8 ms |
2588 KB |
Output is correct |
19 |
Correct |
8 ms |
2784 KB |
Output is correct |
20 |
Correct |
6 ms |
2572 KB |
Output is correct |
21 |
Correct |
28 ms |
3792 KB |
Output is correct |
22 |
Correct |
28 ms |
3620 KB |
Output is correct |
23 |
Correct |
29 ms |
3624 KB |
Output is correct |
24 |
Correct |
28 ms |
3628 KB |
Output is correct |
25 |
Correct |
25 ms |
3620 KB |
Output is correct |
26 |
Correct |
28 ms |
3624 KB |
Output is correct |
27 |
Correct |
34 ms |
3620 KB |
Output is correct |
28 |
Correct |
36 ms |
3624 KB |
Output is correct |
29 |
Correct |
28 ms |
3632 KB |
Output is correct |
30 |
Correct |
24 ms |
3616 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 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 |
2392 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 |
11 ms |
2752 KB |
Output is correct |
17 |
Correct |
11 ms |
2580 KB |
Output is correct |
18 |
Correct |
10 ms |
2572 KB |
Output is correct |
19 |
Correct |
10 ms |
2840 KB |
Output is correct |
20 |
Correct |
6 ms |
2568 KB |
Output is correct |
21 |
Correct |
40 ms |
2856 KB |
Output is correct |
22 |
Correct |
41 ms |
2856 KB |
Output is correct |
23 |
Correct |
40 ms |
2856 KB |
Output is correct |
24 |
Correct |
42 ms |
2860 KB |
Output is correct |
25 |
Correct |
39 ms |
2848 KB |
Output is correct |
26 |
Correct |
40 ms |
2856 KB |
Output is correct |
27 |
Correct |
40 ms |
2856 KB |
Output is correct |
28 |
Correct |
41 ms |
2852 KB |
Output is correct |
29 |
Correct |
40 ms |
2800 KB |
Output is correct |
30 |
Correct |
24 ms |
2840 KB |
Output is correct |
31 |
Correct |
1 ms |
2644 KB |
Output is correct |
32 |
Correct |
0 ms |
2392 KB |
Output is correct |