結果
問題 | No.813 ユキちゃんの冒険 |
ユーザー |
|
提出日時 | 2019-04-12 22:00:32 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,132 bytes |
コンパイル時間 | 713 ms |
コンパイル使用メモリ | 73,508 KB |
実行使用メモリ | 320,916 KB |
最終ジャッジ日時 | 2025-01-02 03:20:13 |
合計ジャッジ時間 | 10,422 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 24 WA * 2 |
ソースコード
#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){ returnx; }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; } } bintC(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; }int N;double p, q;double dp[1010][20010][2];double game(int now, int count, bool is_right){if(dp[now][count][is_right] > -0.1){return dp[now][count][is_right];}else if(now == N){return 0;}else if(now == 0){return 1;}else if(count == 20000){return 0.5;}else if(is_right){return dp[now][count][is_right] = game(now + 1, count + 1, true) * q + game(now - 1, count + 1, false) * p;}else{return dp[now][count][is_right] = game(now + 1, count + 1, true) * p + game(now - 1, count + 1, false) * q;}}int main(){cin >> N >> p >> q;for(int i = 0; i < 1010; i++){for(int j = 0; j < 20010; j++){dp[i][j][0] = dp[i][j][1] = -1;}}fcout << game(1, 0, true) << endl;}