oj.uz

답안 #498325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498325 2021-12-25T04:01:34 Z vinnipuh01 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 204 KB 
#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;
vector <double> v, vv;
double a[ 100001 ], b[ 100001 ];

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 ];
			col += 2;
			ans += b[ i ];
			sum += a[ i ];
			mxx = max( mxx, f( mask, sum, ans, col ) );
			col -= 2;
			ans -= b[ i ];
			sum -= a[ i ];
			mask ^= ( 1 << i );
		}
	}
	return mxx;
}

int main () {
	cin >> n;
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ] >> b[ i ];
		v.push_back( a[ i ] );
		vv.push_back( b[ i ] );
	}
	sort( v.begin(), v.end() );
	sort( vv.begin(), vv.end() );
	double sum, num, ans;
	ans = sum = num = 0;
	double mx = 0;
	while ( true ) {
		if ( !v.size() && !vv.size() )
			break;
		mx = max( mx, min( sum, num ) );
		if ( v.size() && sum < num ) {
			sum += v.back();
			sum --;
			num --;
			ans ++;
			v.pop_back();
		}
		else {
			if ( vv.size() ) {
				num += vv.back();
				vv.pop_back();
				num --;
				sum --;
				ans ++;
			}
			else {
				sum += v.back();
				v.pop_back();
				num --;
				sum --;
				ans ++;
			}
		}
	}
	cout << fixed << setprecision( 4 ) << mx;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -