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

• 問題: No.813 ユキちゃんの冒険
• ユーザー: fiord
• 提出日時: 2019-04-12 23:16:48
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 3,165 bytes
• コンパイル時間: 1,134 ms
• コンパイル使用メモリ: 118,872 KB
• 実行使用メモリ: 121,472 KB
• 最終ジャッジ日時: 2025-01-02 03:42:58
• 合計ジャッジ時間: 4,418 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
other	AC * 5 WA * 21

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()   {cin.tie(0);    cout.sync_with_stdio(false);}
#define reach(i,a)  for(auto i:a)
#define rep(i,n)    for(int i=0;i<((int)n);i++)
#define REP(i,n)    for(int i=0;i<=((int)n);i++)
#define srep(i,a,n) for(int i=a;i<((int)n);i++)
#define SREP(i,a,n) for(int i=a;i<=((int)n);i++)
#define rrep(i,n)   for(int i=n-1;i>=0;i--)
#define RREP(i,n)   for(int i=n;i>=0;i--)
#define all(a)  (a).begin(),(a).end()
#define mp(a,b) make_pair(a,b)
#define mt  make_tuple
#define pb  push_back
template<typename T> istream& operator >> (istream& is, vector<T>& vec) {
    for (T& x : vec)    is >> x;
    return is;
}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "[";
    rep(i, vec.size())  os << (i ? ", " : "") << vec[i];
    os << "]";
    return os;
}
template<typename T> istream& operator >> (istream& is, pair<T, T>& p) {
    is >> p.first >> p.second;
    return is;
}
template<typename T> ostream& operator << (ostream& os, pair<T, T>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
int bitcnt(ll x) {
    x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
    x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
    x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
    x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
    x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
    x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
    return x;
}
int bitcnt(int x) {
    x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
    x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
    x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
    x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
    x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
    return x;
}
ll sqrtll(ll x) {
    ll left = 0, right = x;
    rep(i, 100) {
        ll mid = (left + right) >> 1;
        if (mid*mid <= x)   left = mid;
        else    right = mid;
    }
    return left;
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a%b);
}
#define debug(x)    printf("Case #%d: ", x)
#define DEBUG 0
const ll inf = 1e9;
const ld infl = 1e100;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };
long double prob[6010][3010];
int main() {
    int n;  cin >> n;
    ld p, q;    cin >> p >> q;
    prob[0][1] = 1;
    ld ret = 0;
    rep(i, 6000) {
        SREP(j, 1, n) {
            prob[i + 1][j - 1] += prob[i][j] * p + eps;
            prob[i + 1][j + 1] += prob[i][j] * q + eps;
        }
        ret += prob[i][0];
    }
    printf("%.15Lf\n", ret);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX