Submission #1022003

---

Source Code Expand

#define DEB
#include<bits/stdc++.h>
#define REP(i,m) for(int i=0;i<(m);++i)
#define REPN(i,m,in) for(int i=(in);i<(m);++i)
#define ALL(t) (t).begin(),(t).end()
#define CLR(a) memset((a),0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;


#ifdef DEB
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
#define dumpR(x) cerr<<"\x1b[31m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpY(x) cerr<<"\x1b[33m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpG(x) cerr<<"\x1b[32m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
#else
#define dump(x) ;
#define dumpR(x) ;
#define dumpY(x) ;
#define dumpG(x) ;
#define prl ;
template<class T> void debug(T a,T b){ ;}
#endif

template<class T> void chmin(T& a,const T& b) { if(a>b) a=b; }
template<class T> void chmax(T& a,const T& b) { if(a<b) a=b; }

typedef long long int lint;
typedef pair<int,int> pi;

namespace std{
  template<class S,class T>
  ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.fr<<','<<a.sc<<')';
    return out;
  }
}

//const int INF=5e8;
double p[10],q[10];
void input(double* a){
  REP(i,6) cin>>a[i],a[i]/=100;
}

typedef pair<double,double> pd;
pd doit(pd a,pd b){
  if(a.fr>b.fr) swap(a,b);
  if(a.sc<=b.sc) return mp(-1,-1);
  double d1=b.fr-a.fr,d2=a.sc-b.sc;
  return mp(d1/(d1+d2),(a.fr*d2+a.sc*d1)/(d1+d2));
}
pd ar[1005];

double solve(double a){
  double res=0;
  REP(i,1<<6) chmax(res,ar[i].fr*(1-a)+a*ar[i].sc);
  return res;
}
int main(){
  input(p);input(q);

  REP(i,1<<6){
    double x=0,y=0;
    REP(j,6){
      if(i>>j&1) x+=q[j];
      else y+=p[j];
    }
    ar[i]=mp(x,y);
  }
  const int m =1<<6;
  double res=1;
  REP(i,m) REP(j,m){
    pd cross=doit(ar[i],ar[j]);
    chmin(res,solve(cross.fr));
  }
  chmin(res,solve(0));
  chmin(res,solve(1));

  printf("%.10f\n",res);
  return 0;
}

Submission Info

Judge Result