Submission #938372

#	Time	Username	Problem	Language	Result	Execution time	Memory
938372		vjudge1	Sure Bet (CEOI17_sure)	C++17	100 / 100	90 ms	15832 KiB

sure

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 1e6 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n ;
ld res , a[N] , b[N] ;
pair <ld , int> p1[N] , p2[N] ;

void solve(){
	cout << fixed << setprecision(4) ;
	cin >> n ;
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i] >> b[i] ;
	sort ( a+1 , a + n+1 ) ; sort ( b+1 , b + n+1 ) ;
	reverse ( a+1 , a + n+1 ) ; reverse ( b+1 , b + n+1 ) ;
	for ( int i = 1 ; i <= n ; i ++ ){
		p1[i].ff = p1[i-1].ff + a[i] ;
		p2[i].ff = p2[i-1].ff + b[i] ;
		p1[i].ss = i ;
		p2[i].ss = i ;
	}
	sort ( p1+1 , p1+n+1 ) ;
	sort ( p2+1 , p2+n+1 ) ;
	int j = 1 ;
	for ( int i = 1 ; i <= n ; i ++ ){
		chmax ( res , min(p1[j].ff-p2[i].ss-p1[j].ss,p2[i].ff-p1[j].ss-p2[i].ss) ) ;
		while ( j < n && p1[j].ff < p2[i].ff ) 
			j ++ , chmax ( res , min(p1[j].ff-p2[i].ss-p1[j].ss,p2[i].ff-p1[j].ss-p2[i].ss) ) ;
	}
	cout << res ;
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message (stderr)

sure.cpp: In function 'void fopn(std::string)':
sure.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40