Submission #1001264
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
// P(A,x)=P(x|A)*y
// P(B,x)=P(x|B)*(1.0-y)
R p[6],q[6],x[6];
R calc(R y){
R ret=0.0;
rep(i,6) ret+=max(y*p[i],(1.0-y)*q[i]);
return ret;
}
int main(void){
rep(i,6) cin >> p[i],p[i]/=100.0;
rep(i,6) cin >> q[i],q[i]/=100.0;
R l=0.0,r=1.0;
rep(loop,200){
const R lm=(2*l+r)/3,rm=(l+2*r)/3;
if(calc(lm)<calc(rm))
r=rm;
else
l=lm;
}
cout.precision(20);
cout << fixed << calc(l) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Dice Game |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
1000 |
Code Size |
1659 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
1000 / 1000 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example0.txt, example1.txt |
All |
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, example0.txt, example1.txt |
Case Name |
Status |
Exec Time |
Memory |
000.txt |
AC |
3 ms |
256 KB |
001.txt |
AC |
3 ms |
256 KB |
002.txt |
AC |
3 ms |
256 KB |
003.txt |
AC |
3 ms |
256 KB |
004.txt |
AC |
3 ms |
256 KB |
005.txt |
AC |
3 ms |
256 KB |
006.txt |
AC |
3 ms |
256 KB |
007.txt |
AC |
3 ms |
256 KB |
008.txt |
AC |
3 ms |
256 KB |
009.txt |
AC |
3 ms |
256 KB |
010.txt |
AC |
3 ms |
256 KB |
011.txt |
AC |
3 ms |
256 KB |
012.txt |
AC |
3 ms |
256 KB |
013.txt |
AC |
3 ms |
256 KB |
014.txt |
AC |
3 ms |
256 KB |
015.txt |
AC |
3 ms |
256 KB |
016.txt |
AC |
3 ms |
256 KB |
017.txt |
AC |
3 ms |
256 KB |
018.txt |
AC |
3 ms |
256 KB |
019.txt |
AC |
3 ms |
256 KB |
020.txt |
AC |
3 ms |
256 KB |
021.txt |
AC |
3 ms |
256 KB |
022.txt |
AC |
3 ms |
256 KB |
023.txt |
AC |
3 ms |
256 KB |
024.txt |
AC |
3 ms |
256 KB |
025.txt |
AC |
3 ms |
256 KB |
026.txt |
AC |
3 ms |
256 KB |
027.txt |
AC |
3 ms |
256 KB |
028.txt |
AC |
3 ms |
256 KB |
029.txt |
AC |
3 ms |
256 KB |
030.txt |
AC |
3 ms |
256 KB |
031.txt |
AC |
3 ms |
256 KB |
032.txt |
AC |
3 ms |
256 KB |
033.txt |
AC |
3 ms |
256 KB |
034.txt |
AC |
3 ms |
256 KB |
035.txt |
AC |
3 ms |
256 KB |
036.txt |
AC |
3 ms |
256 KB |
037.txt |
AC |
3 ms |
256 KB |
038.txt |
AC |
3 ms |
256 KB |
example0.txt |
AC |
3 ms |
256 KB |
example1.txt |
AC |
3 ms |
256 KB |