# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938277 | vjudge1 | Sure Bet (CEOI17_sure) | C++17 | 2057 ms | 13416 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 ;
ld a[N] , b[N] ;
ld p1[N] , p2[N] ;
ld ans[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] = p1[i-1] + a[i] - 1 ;
p2[i] = p2[i-1] + b[i] - 1 ;
}
for ( int i = 1 ; i <= n ; i ++ ){
for ( int j = 1 ; j <= n ; j ++ ) chmax ( ans[i] , min ( p2[j]-i , p1[i]-j ) ) ;
chmax ( res , ans[i] ) ;
} cout << res ;
}
signed main(){
ios ;
int t = 1 ;
//cin >> t ;
while ( t -- ) solve() ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |