Submission #1553081

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

vector<double> A(6),B(6);
double f(double x){
	double ans = 0.0;
	for(int i=0;i<6;++i){
		ans += max(A[i]*x,B[i]*(1-x));
	}
	return ans;
}
void solve(){
	for(int i=0;i<6;++i){cin >> A[i];}
	for(int i=0;i<6;++i){cin >> B[i];}
	double L = 0.0;
	double R = 1.0;
	while( abs(R-L) > EPS){
		double midL,midR;
		double midLval,midRval;
		midL = (L*2+R)/3;
		midR = (L+R*2)/3;
		midLval = f(midL);
		midRval = f(midR);
		if( midRval < midLval ){
			L = midL;
		}else{
			R = midR;
		}
	}
	cout << f(R)/100 << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result