結果
問題 | No.2524 Stripes |
ユーザー |
|
提出日時 | 2023-10-28 01:55:01 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 818 ms / 7,000 ms |
コード長 | 12,494 bytes |
コンパイル時間 | 4,383 ms |
コンパイル使用メモリ | 241,540 KB |
実行使用メモリ | 32,896 KB |
最終ジャッジ日時 | 2024-09-25 15:56:51 |
合計ジャッジ時間 | 11,426 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#line 1 "a.cpp"#include <atcoder/convolution>#include <atcoder/modint>#line 2 "fps/fps.hpp"#include <algorithm>#include <cassert>#include <optional>#include <vector>#line 2 "modint/base.hpp"#include <concepts>#include <iostream>#include <utility>namespace ebi {template <class T>concept Modint = requires(T a, T b) {a + b;a - b;a * b;a / b;a.inv();a.val();a.pow(std::declval<long long>());T::mod();};template <Modint mint> std::istream &operator>>(std::istream &os, mint &a) {long long x;os >> x;a = x;return os;}template <Modint mint>std::ostream &operator<<(std::ostream &os, const mint &a) {return os << a.val();}} // namespace ebi#line 9 "fps/fps.hpp"namespace ebi {template <Modint mint,std::vector<mint> (*convolution)(const std::vector<mint> &,const std::vector<mint> &)>struct FormalPowerSeries : std::vector<mint> {private:using std::vector<mint>::vector;using std::vector<mint>::vector::operator=;using FPS = FormalPowerSeries;public:FormalPowerSeries(const std::vector<mint> &a) {*this = a;}FPS operator+(const FPS &rhs) const noexcept {return FPS(*this) += rhs;}FPS operator-(const FPS &rhs) const noexcept {return FPS(*this) -= rhs;}FPS operator*(const FPS &rhs) const noexcept {return FPS(*this) *= rhs;}FPS operator/(const FPS &rhs) const noexcept {return FPS(*this) /= rhs;}FPS operator%(const FPS &rhs) const noexcept {return FPS(*this) %= rhs;}FPS operator+(const mint &rhs) const noexcept {return FPS(*this) += rhs;}FPS operator-(const mint &rhs) const noexcept {return FPS(*this) -= rhs;}FPS operator*(const mint &rhs) const noexcept {return FPS(*this) *= rhs;}FPS operator/(const mint &rhs) const noexcept {return FPS(*this) /= rhs;}FPS &operator+=(const FPS &rhs) noexcept {if (this->size() < rhs.size()) this->resize(rhs.size());for (int i = 0; i < (int)rhs.size(); ++i) {(*this)[i] += rhs[i];}return *this;}FPS &operator-=(const FPS &rhs) noexcept {if (this->size() < rhs.size()) this->resize(rhs.size());for (int i = 0; i < (int)rhs.size(); ++i) {(*this)[i] -= rhs[i];}return *this;}FPS &operator*=(const FPS &rhs) noexcept {*this = convolution(*this, rhs);return *this;}FPS &operator/=(const FPS &rhs) noexcept {int n = deg() - 1;int m = rhs.deg() - 1;if (n < m) {*this = {};return *this;}*this = (*this).rev() * rhs.rev().inv(n - m + 1);(*this).resize(n - m + 1);std::reverse((*this).begin(), (*this).end());return *this;}FPS &operator%=(const FPS &rhs) noexcept {*this -= *this / rhs * rhs;shrink();return *this;}FPS &operator+=(const mint &rhs) noexcept {if (this->empty()) this->resize(1);(*this)[0] += rhs;return *this;}FPS &operator-=(const mint &rhs) noexcept {if (this->empty()) this->resize(1);(*this)[0] -= rhs;return *this;}FPS &operator*=(const mint &rhs) noexcept {for (int i = 0; i < deg(); ++i) {(*this)[i] *= rhs;}return *this;}FPS &operator/=(const mint &rhs) noexcept {mint inv_rhs = rhs.inv();for (int i = 0; i < deg(); ++i) {(*this)[i] *= inv_rhs;}return *this;}FPS operator>>(int d) const {if (deg() <= d) return {};FPS f = *this;f.erase(f.begin(), f.begin() + d);return f;}FPS operator<<(int d) const {FPS f = *this;f.insert(f.begin(), d, 0);return f;}FPS operator-() const {FPS g(this->size());for (int i = 0; i < (int)this->size(); i++) g[i] = -(*this)[i];return g;}FPS pre(int sz) const {return FPS(this->begin(), this->begin() + std::min(deg(), sz));}FPS rev() const {auto f = *this;std::reverse(f.begin(), f.end());return f;}FPS differential() const {int n = deg();FPS g(std::max(0, n - 1));for (int i = 0; i < n - 1; i++) {g[i] = (*this)[i + 1] * (i + 1);}return g;}FPS integral() const {int n = deg();FPS g(n + 1);g[0] = 0;if (n > 0) g[1] = 1;auto mod = mint::mod();for (int i = 2; i <= n; i++) g[i] = (-g[mod % i]) * (mod / i);for (int i = 0; i < n; i++) g[i + 1] *= (*this)[i];return g;}FPS inv(int d = -1) const {int n = 1;if (d < 0) d = deg();FPS g(n);g[0] = (*this)[0].inv();while (n < d) {n <<= 1;g = (g * 2 - g * g * this->pre(n)).pre(n);}g.resize(d);return g;}FPS log(int d = -1) const {assert((*this)[0].val() == 1);if (d < 0) d = deg();return ((*this).differential() * (*this).inv(d)).pre(d - 1).integral();}FPS exp(int d = -1) const {assert((*this)[0].val() == 0);int n = 1;if (d < 0) d = deg();FPS g(n);g[0] = 1;while (n < d) {n <<= 1;g = (g * (this->pre(n) - g.log(n) + 1)).pre(n);}g.resize(d);return g;}FPS pow(int64_t k, int d = -1) const {const int n = deg();if (d < 0) d = n;if (k == 0) {FPS f(d);if (d > 0) f[0] = 1;return f;}for (int i = 0; i < n; i++) {if ((*this)[i] != 0) {mint rev = (*this)[i].inv();FPS f = (((*this * rev) >> i).log(d) * k).exp(d);f *= (*this)[i].pow(k);f = (f << (i * k)).pre(d);if (f.deg() < d) f.resize(d);return f;}if (i + 1 >= (d + k - 1) / k) break;}return FPS(d);}int deg() const {return (*this).size();}void shrink() {while ((!this->empty()) && this->back() == 0) this->pop_back();}int count_terms() const {int c = 0;for (int i = 0; i < deg(); i++) {if ((*this)[i] != 0) c++;}return c;}std::optional<FPS> sqrt(int d = -1) const;static FPS exp_x(int n) {FPS f(n);mint fact = 1;for (int i = 1; i < n; i++) fact *= i;f[n - 1] = fact.inv();for (int i = n - 1; i >= 0; i--) f[i - 1] = f[i] * i;return f;}};} // namespace ebi#line 2 "template/template.hpp"#include <bit>#include <bitset>#line 5 "template/template.hpp"#include <chrono>#include <climits>#include <cmath>#include <complex>#include <cstddef>#include <cstdint>#include <cstdlib>#include <cstring>#include <functional>#include <iomanip>#line 16 "template/template.hpp"#include <limits>#include <map>#include <memory>#include <numbers>#include <numeric>#line 22 "template/template.hpp"#include <queue>#include <random>#include <ranges>#include <set>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#line 34 "template/template.hpp"#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#line 2 "template/debug_template.hpp"#line 4 "template/debug_template.hpp"namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}} // namespace ebi#line 2 "template/int_alias.hpp"#line 4 "template/int_alias.hpp"namespace ebi {using std::size_t;using i8 = std::int8_t;using u8 = std::uint8_t;using i16 = std::int16_t;using u16 = std::uint16_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;} // namespace ebi#line 2 "template/io.hpp"#line 7 "template/io.hpp"namespace ebi {template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}void fast_io() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);}} // namespace ebi#line 2 "template/utility.hpp"#line 5 "template/utility.hpp"#line 7 "template/utility.hpp"namespace ebi {template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}template <class T> T safe_ceil(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return (a / b) + 1;elsereturn -((-a) / b);}template <class T> T safe_floor(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return a / b;elsereturn -((-a) / b) - 1;}constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#line 7 "a.cpp"namespace ebi {using mint = atcoder::modint998244353;using FPS = FormalPowerSeries<mint, atcoder::convolution>;void main_() {int n;std::string s;std::cin >> n >> s;using Matrix = std::array<std::array<FPS, 2>, 2>;auto mul = [&](const Matrix &a, const Matrix &b) -> Matrix {Matrix c;rep(i, 0, 2) rep(j, 0, 2) {c[i][j] = FPS{0};rep(k, 0, 2) {c[i][j] += a[i][k] * b[k][j];}}return c;};Matrix r = {{FPS{1}, FPS{0, 1}, FPS{0}, FPS{1}}};Matrix b = {{FPS{1}, FPS{0}, FPS{0, 1}, FPS{1}}};Matrix I = {{FPS{1}, FPS{0}, FPS{0}, FPS{1}}};std::deque<Matrix> que;rep(i,0,n) {if(s[i] == 'R') que.push_back(r);else que.push_back(b);}{int pow2 = std::bit_ceil(que.size());while((int)que.size() < pow2) que.push_back(I);}while(que.size() > 1) {auto l = que.back();que.pop_back();auto r = que.back();que.pop_back();que.push_front(mul(l, r));}assert(que.size() == 1);auto p = que.front();FPS ans(n+1);rep(i,0,2) rep(j,0,2) {ans += p[i][j];}rep(i,1,n+1) {std::cout << ans[i] << '\n';}}} // namespace ebiint main() {ebi::fast_io();int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}