Submission #11138146

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
	x=0; char c=getchar(); int f=1;
	while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
	while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> T gcd(T a, T b){return !b?a:gcd(b,a%b);}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
	static ui seed=416;
	return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 66;
double p[N],q[N];int n=6,_;
double calc(double x){
	double res=0;
	rep(i,1,n)res+=max(x*p[i],(1-x)*q[i]);
	return res;
}
int main() {
	rep(i,1,n)read(_),p[i]=1.0*_/100;
	rep(i,1,n)read(_),q[i]=1.0*_/100;
	double l=0,r=1,res=1;
	rep(k,1,60){
		double m1=(2*l+r)/3,m2=(l+2*r)/3;
		double v1=calc(m1),v2=calc(m2);
		umin(res,min(v1,v2));
		if(v1<v2)r=m2;else l=m1;
	}
	printf("%.11lf",res);
	return 0;
}

Submission Info

Judge Result