#338160 (C++14) No.813 ユキちゃんの冒険

• 問題: No.813 ユキちゃんの冒険
• ユーザー: ミドリムシ
• 提出日時: 2019-04-13 01:08:00
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,066 bytes
• コンパイル時間: 985 ms
• コンパイル使用メモリ: 77,916 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-10 14:06:41
• 合計ジャッジ時間: 1,855 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	3 ms; 5,376 KB
testcase_02	AC	39 ms; 5,376 KB
testcase_03	AC	8 ms; 5,376 KB
testcase_04	AC	20 ms; 5,376 KB
testcase_05	AC	62 ms; 5,376 KB
testcase_06	AC	9 ms; 5,376 KB
testcase_07	AC	4 ms; 5,376 KB
testcase_08	AC	47 ms; 5,376 KB
testcase_09	AC	3 ms; 5,376 KB
testcase_10	AC	9 ms; 5,376 KB
testcase_11	AC	7 ms; 5,376 KB
testcase_12	AC	14 ms; 5,376 KB
testcase_13	AC	37 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	82 ms; 5,376 KB
testcase_16	AC	56 ms; 5,376 KB
testcase_17	AC	4 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	20 ms; 5,376 KB
testcase_20	AC	7 ms; 5,376 KB
testcase_21	AC	4 ms; 5,376 KB
testcase_22	AC	4 ms; 5,376 KB
testcase_23	AC	11 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	WA	-

ソースコード

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <cassert>
#include <iomanip>
using namespace std;
using bint = long long;
const bint mod = 1000000007;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((bint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
bint power(bint base, bint exponent, bint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ bint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<bint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } bint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }

using fl = double;

int cnt = 10000;
fl dp_l[1010], dp_r[1010];

int main(){
    int N;
    double p, q;
    cin >> N >> p >> q;
    for(int i = 0; i < N + 2; i++){
        dp_l[i] = dp_r[i] = (i == 0);
    }
    for(int i = 0; i < cnt; i++){
        fl dp2_l[N + 2], dp2_r[N + 2];
        dp2_l[0] = 1;
        dp2_l[N + 1] = 0;
        for(int j = 1; j <= N; j++){
            dp2_l[j] = dp_l[j - 1] * q + dp_r[j + 1] * p;
        }
        dp2_r[0] = 1;
        dp2_r[N + 1] = 0;
        for(int j = 1; j <= N; j++){
            dp2_r[j] = dp_l[j - 1] * p + dp_r[j + 1] * q;
        }
        for(int j = 0; j < N + 2; j++){
            dp_l[j] = dp2_l[j], dp_r[j] = dp2_r[j];
        }
    }
    fcout << double(dp_r[1]) << endl;
}