結果

問題 No.162 8020運動
ユーザー kei
提出日時 2018-08-30 16:19:58
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 74 ms / 5,000 ms
コード長 2,714 bytes
コンパイル時間 1,614 ms
コンパイル使用メモリ 167,936 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-13 19:50:30
合計ジャッジ時間 4,058 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out 
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << 
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
 <url:https://yukicoder.me/problems/no/162>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
typedef long double ld;
ld memo[21][15];
ld P[3];
ld rec(int a,int tooth){
    if(a == 0) return tooth;
    ld& ret = memo[a][tooth];
    if(!(ret < 0)) return ret;
    ret = 0;
    if(tooth == 1){
        ret  = (1-P[0])*rec(a-1,tooth);
    }else{
        for(int t = 0; t < (1<<tooth);t++){
            ld Ptooth = 1;
            ld sum = 0;
            int cnt_tooth = 0;
            
            for(int b = 0; b <= tooth;b++){
                if((t>>b)&1){
                    if(b == 0 || b == tooth-1){
                        Ptooth *= (1-P[1]);
                    }else{
                        Ptooth *= (1-P[2]);
                    }
                    cnt_tooth++;
                }else{
                    if(b == 0 || b == tooth-1){
                        Ptooth *= P[1];
                    }else if(b != tooth){
                        Ptooth *= P[2];
                    }
                    if(cnt_tooth){
                        sum += rec(a-1,cnt_tooth);
                    }
                    cnt_tooth = 0;
                }
            }
            ret += Ptooth * sum;
        }
    }
    return ret;
}
ld solve(){
    fill(*memo,*memo+21*15,-1);
    ld res = 0;
    int A; cin >> A; A = 80 - A;
    for(int i = 0; i < 3;i++){ cin >> P[i]; P[i]/=100;}
    res = rec(A,14)*2;
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(12) << solve() << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0