結果
| 問題 |
No.76 回数の期待値で練習
|
| コンテスト | |
| ユーザー |
keijak
|
| 提出日時 | 2021-10-19 23:40:30 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 23 ms / 5,000 ms |
| コード長 | 3,420 bytes |
| コンパイル時間 | 2,636 ms |
| コンパイル使用メモリ | 246,264 KB |
| 実行使用メモリ | 19,112 KB |
| 最終ジャッジ日時 | 2024-09-20 06:28:24 |
| 合計ジャッジ時間 | 3,168 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 2 |
ソースコード
#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using Int = long long;
using Real = long double;
template<typename T, typename U>
inline bool chmax(T &a, U b) {
return a < b and ((a = std::move(b)), true);
}
template<typename T, typename U>
inline bool chmin(T &a, U b) {
return a > b and ((a = std::move(b)), true);
}
template<typename T>
inline int ssize(const T &a) {
return (int) a.size();
}
template<class T>
inline std::ostream &print_one(const T &x, char endc) {
if constexpr (std::is_same_v<T, bool>) {
return std::cout << (x ? "Yes" : "No") << endc;
} else {
return std::cout << x << endc;
}
}
template<class T>
inline std::ostream &print(const T &x) { return print_one(x, '\n'); }
template<typename T, typename... Ts>
std::ostream &print(const T &head, Ts... tail) {
return print_one(head, ' '), print(tail...);
}
inline std::ostream &print() { return std::cout << '\n'; }
template<typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
std::string_view ends = "\n",
std::ostream &os = std::cout) {
auto b = std::begin(a), e = std::end(a);
for (auto it = std::begin(a); it != e; ++it) {
if (it != b) os << sep;
os << *it;
}
return os << ends;
}
template<typename T, typename = void>
struct is_iterable : std::false_type {};
template<typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>()))>>
: std::true_type {
};
template<typename T, typename = std::enable_if_t<
is_iterable<T>::value && !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
return print_seq(a, ", ", "", (os << "{")) << "}";
}
struct CastInput {
template<typename T>
operator T() const {
T x;
std::cin >> x;
return x;
}
struct Sized {
std::size_t n;
template<typename T>
operator T() const {
T x(n);
for (auto &e: x) std::cin >> e;
return x;
}
};
Sized operator()(std::size_t n) const { return {n}; }
} const in;
inline void check(bool cond, const char *message = "!ERROR!") {
if (not cond) throw std::runtime_error(message);
}
#ifdef MY_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#define cerr if(false)std::cerr
#endif
using namespace std;
constexpr int L = 1000005;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cout << std::fixed << std::setprecision(18);
auto dp = vector(L, Real(0));
dp[0] = 0;
dp[1] = 1.0000000000000000;
dp[2] = 1.0833333333333333;
dp[3] = 1.2569444444444444;
dp[4] = 1.5353009259259260;
dp[5] = 1.6915991512345676;
dp[6] = 2.0513639724794235;
array<Real, 7> p = {0};
p[1] = dp[2] - 1;
for (int i = 2; i <= 5; ++i) {
Real s = dp[i + 1] - 1;
REP(j, 1, i) {
s -= p[j] * dp[i + 1 - j];
}
s /= dp[1];
p[i] = s;
}
p[6] = 1;
REP(j, 1, 6) p[6] -= p[j];
DUMP(p);
for (int i = 1; i < L; ++i) {
Real t = 0;
for (int j = 1; j <= 6; ++j) {
int s = max(i - j, 0);
t += (1 + dp[s]) * p[j];
}
dp[i] = t;
}
const int T = in;
REP(t, T) {
int n = in;
print(dp[n]);
}
}
keijak