Submission #1003409
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define mp make_pair #define pb push_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> ii; typedef vector<int> vi; typedef long double ld; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; typedef set<int>::iterator sit; typedef map<int,int>::iterator mit; typedef vector<int>::iterator vit; ld p[7]; ld q[7]; const ld eps = 1e-12; ld prob(ld mid) { ld ans = 0; for(int i = 0; i < 6; i++) { ans += max(mid*p[i], (1-mid)*q[i]); } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); for(int i = 0; i < 6; i++) { cin>>p[i]; p[i]*=0.01; } for(int i = 0; i < 6; i++) { cin>>q[i]; q[i]*=0.01; } ld lo = 0; ld hi = 1; for(int i = 0; i < 90; i++) { ld r1 = lo + (hi-lo)/3; ld r2 = lo + 2*(hi-lo)/3; //cerr<<fixed<<setprecision(12)<<r1<<' '<<r2<<'\n'; ld d1 = prob(r1); ld d2 = prob(r2); if(d1<d2) { hi = r2; } else { lo = r1; } } cout<<fixed<<setprecision(12)<<prob(lo)<<'\n'; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | zscoder |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1299 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
001.txt | AC | 2 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 2 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 2 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 2 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 2 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 2 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
019.txt | AC | 2 ms | 256 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 2 ms | 256 KB |
023.txt | AC | 2 ms | 256 KB |
024.txt | AC | 2 ms | 256 KB |
025.txt | AC | 2 ms | 256 KB |
026.txt | AC | 2 ms | 256 KB |
027.txt | AC | 2 ms | 256 KB |
028.txt | AC | 2 ms | 256 KB |
029.txt | AC | 2 ms | 256 KB |
030.txt | AC | 2 ms | 256 KB |
031.txt | AC | 2 ms | 256 KB |
032.txt | AC | 2 ms | 256 KB |
033.txt | AC | 2 ms | 256 KB |
034.txt | AC | 2 ms | 256 KB |
035.txt | AC | 2 ms | 256 KB |
036.txt | AC | 2 ms | 256 KB |
037.txt | AC | 2 ms | 256 KB |
038.txt | AC | 2 ms | 256 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |