Submission #931005

#	Time	Username	Problem	Language	Result	Execution time	Memory
931005		thunopro	Gap (APIO16_gap)	C++14	100 / 100	42 ms	3792 KiB

gap

#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 (stderr)

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) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70