Submission #11137728
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("%lf",res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | supy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1395 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | WA | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | WA | 1 ms | 256 KB |
006.txt | WA | 1 ms | 256 KB |
007.txt | WA | 1 ms | 256 KB |
008.txt | WA | 1 ms | 256 KB |
009.txt | WA | 1 ms | 256 KB |
010.txt | WA | 1 ms | 256 KB |
011.txt | WA | 1 ms | 256 KB |
012.txt | WA | 1 ms | 256 KB |
013.txt | WA | 1 ms | 256 KB |
014.txt | WA | 1 ms | 256 KB |
015.txt | WA | 1 ms | 256 KB |
016.txt | WA | 1 ms | 256 KB |
017.txt | WA | 1 ms | 256 KB |
018.txt | WA | 1 ms | 256 KB |
019.txt | WA | 1 ms | 256 KB |
020.txt | WA | 1 ms | 256 KB |
021.txt | WA | 1 ms | 256 KB |
022.txt | AC | 1 ms | 256 KB |
023.txt | WA | 1 ms | 256 KB |
024.txt | AC | 1 ms | 256 KB |
025.txt | WA | 1 ms | 256 KB |
026.txt | AC | 1 ms | 256 KB |
027.txt | WA | 1 ms | 256 KB |
028.txt | WA | 1 ms | 256 KB |
029.txt | WA | 1 ms | 256 KB |
030.txt | WA | 1 ms | 256 KB |
031.txt | WA | 1 ms | 256 KB |
032.txt | WA | 1 ms | 256 KB |
033.txt | WA | 1 ms | 256 KB |
034.txt | WA | 1 ms | 256 KB |
035.txt | AC | 1 ms | 256 KB |
036.txt | WA | 1 ms | 256 KB |
037.txt | WA | 1 ms | 256 KB |
038.txt | WA | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |