Submission #498312

#TimeUsernameProblemLanguageResultExecution timeMemory
498312vinnipuh01Sure Bet (CEOI17_sure)C++17
0 / 100
0 ms204 KiB
#include <iostream> #include <bits/stdc++.h> #include <cmath> #include <algorithm> #include <vector> #include <deque> #include <set> #include <stack> #include <string> #include <map> #include <queue> using namespace std; const long long oo = 1000000000000000000; long long int sum, ans = 0, mx = 0, mn = 1000000000, num, pos; /* ViHHiPuh (( `'-""``""-'` )) )-__-_.._-__-( / --- (o _ o) --- \ \ .-* ( .0. ) *-. / _'-. ,_ '=' _, .-'_ / `;#'#'# - #'#'#;` \ \_)) -----'#'----- ((_/ # --------- # '# ------- ------ #' /..-'# ------- #'-.\ _\...-\'# -- #'/-.../_ ((____)- '#' -(____)) cout << fixed << setprecision(6) << x; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); freopen ( "sum.in", "r", stdin ) */ int n; double a[ 100001 ], b[ 1000001 ]; double f( int mask, double sum, double ans, double col ) { double mxx = min( sum - col, ans - col ); for ( int i = 0; i < n; i ++ ) { if ( !( mask & ( 1 << i ) ) ) { mask |= ( 1 << i ); col ++; sum += a[ i ]; mxx = max( mxx, f( mask, sum, ans, col ) ); sum -= a[ i ]; ans += b[ i ]; mxx = max( mxx, f( mask, sum, ans, col ) ); col --; ans -= b[ i ]; mask ^= ( 1 << i ); } } return mxx; } int main () { cin >> n; for ( int i = 0; i < n; i ++ ) cin >> a[ i ] >> b[ i ]; cout << fixed << setprecision( 5 ) << f( 0, 0, 0, 0 ); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...