Submission #1001600
Source Code Expand
#include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cassert> #include <algorithm> #include <iterator> #include <string> #include <vector> #include <list> #include <deque> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <tuple> #include <queue> #include <stack> #include <functional> #include <utility> #include <complex> #include <bitset> #include <numeric> #include <random> using namespace std; #define REP(i,n) for(int (i)=0; (i)<(n) ;++(i)) #define REPN(i,a,n) FOR((i),(a),(a)+(n)) #define FOR(i,a,b) for(int (i)=(a); (i)<(b) ;++(i)) #define PB push_back #define MP make_pair #define SE second #define FI first #define DBG(a) cerr<<(a)<<endl; #define ALL(v) (v).begin(),(v).end() typedef long long LL; typedef pair<LL, LL> PLL; typedef vector<LL> VLL; const LL LINF=334ll<<53; const int INF=15<<26; const LL MOD=1E9+7; class com{ public: bool operator()(pair<int,int> a,pair<int,int> b)const{ return (a.FI/(a.FI+a.SE))<(b.FI/(b.FI+b.SE)); } }; bool comp(const pair<double,double> a, const pair<double,double> b){ return (a.FI/(a.FI+a.SE))>(b.FI/(b.FI+b.SE)); } int main(){ cin.tie(0); ios::sync_with_stdio(false); vector<pair<double,double>> d(6); FOR(i,0,6)cin>>d[i].FI; FOR(i,0,6)cin >> d[i].SE; REP(i,d.size()){ if(d[i].FI==0 and d[i].SE==0){ d.erase(d.begin()+i); i--; } } sort(d.begin(),d.end(),comp); double ans=1.0; REP(i,d.size()){ double tmp=0,tmp2=0,r=d[i].SE/(d[i].FI+d[i].SE); REP(j,d.size()){ tmp+=max(d[j].FI*r/100,d[j].SE*(1-r)/100); } ans=min(ans,tmp); //cout << fixed<< setprecision(10)<< r <<' '<<tmp<<endl; } cout << fixed<< setprecision(10)<<ans <<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | Hoi_koro |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1902 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 |