Submission #1939724
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(x,y) (x=min(x,y)) #define chmax(x,y) (x=max(x,y)) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} #define N 6 double p[2][N]; double calc(double x){ double y = 0.0; //rep(i, N) y += (x*x*p[0][i]*p[0][i]+(1-x)*(1-x)*p[1][i]*p[1][i])/(x*p[0][i]+(1-x)*p[1][i]); //rep(i, N) y += (x*x*p[0][i]*p[0][i]+(1-x)*(1-x)*p[1][i]*p[1][i]); rep(i, N) y += max(x*p[0][i], (1-x)*p[1][i]); return y; } int main(){ rep(j, 2) rep(i, N){ cin>>p[j][i]; p[j][i] /= 100.0; } double lb = 0.0, ub = 1.0; rep(_, 1000){ double lb2 = (lb*2+ub)/3, ub2 = (lb+ub*2)/3; double a = calc(lb2), b = calc(ub2); if(a<b) ub = ub2; else lb = lb2; } cout.precision(20); cout<<calc(lb)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1742 Byte |
Status | AC |
Exec Time | 1 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 | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
019.txt | AC | 1 ms | 256 KB |
020.txt | AC | 1 ms | 256 KB |
021.txt | AC | 1 ms | 256 KB |
022.txt | AC | 1 ms | 256 KB |
023.txt | AC | 1 ms | 256 KB |
024.txt | AC | 1 ms | 256 KB |
025.txt | AC | 1 ms | 256 KB |
026.txt | AC | 1 ms | 256 KB |
027.txt | AC | 1 ms | 256 KB |
028.txt | AC | 1 ms | 256 KB |
029.txt | AC | 1 ms | 256 KB |
030.txt | AC | 1 ms | 256 KB |
031.txt | AC | 1 ms | 256 KB |
032.txt | AC | 1 ms | 256 KB |
033.txt | AC | 1 ms | 256 KB |
034.txt | AC | 1 ms | 256 KB |
035.txt | AC | 1 ms | 256 KB |
036.txt | AC | 1 ms | 256 KB |
037.txt | AC | 1 ms | 256 KB |
038.txt | AC | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |