제출 #498346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498346		vinnipuh01	Sure Bet (CEOI17_sure)	C++17	20 / 100	2080 ms	308 KiB

sure

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define double long double
 
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[ 100001 ];
 
double f( int mask, int o, double sum, double ans, double col ) {
	double mxx = min( sum - col, ans - col );
	for ( int i = o; i < n; i ++ ) {
		if ( !( mask & ( 1 << i ) ) ) {
			mask |= ( 1 << i );
			col ++;
			sum += a[ i ];
			mxx = max( mxx, f( mask, i + 1, sum, ans, col ) );
			sum -= a[ i ];
			ans += b[ i ];
			mxx = max( mxx, f( mask, i + 1, sum, ans, col ) );
			col --;
			ans -= b[ i ];
			col += 2;
			ans += b[ i ];
			sum += a[ i ];
			mxx = max( mxx, f( mask, i + 1, sum, ans, col ) );
			col -= 2;
			ans -= b[ i ];
			sum -= a[ 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( 4 ) << f( 0, 0, 0, 0, 0 );
}

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