結果

問題 No.2524 Stripes
ユーザー shobonvip
提出日時 2023-10-27 22:07:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 575 ms / 7,000 ms
コード長 2,794 bytes
コンパイル時間 3,900 ms
コンパイル使用メモリ 263,640 KB
最終ジャッジ日時 2025-02-17 15:06:18
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/
/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/
typedef long long ll;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
template <typename T> bool chmin(T &a, const T &b) {
if (a <= b) return false;
a = b;
return true;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a >= b) return false;
a = b;
return true;
}
template <typename T> T max(vector<T> &a){
assert(!a.empty());
T ret = a[0];
for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
return ret;
}
template <typename T> T min(vector<T> &a){
assert(!a.empty());
T ret = a[0];
for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
return ret;
}
template <typename T> T sum(vector<T> &a){
T ret = 0;
for (int i=0; i<(int)a.size(); i++) ret += a[i];
return ret;
}
int main(){
// (start, end):
// FFT
struct S{
vector<mint> bb;
vector<mint> br;
vector<mint> rb;
vector<mint> rr;
};
int n; cin >> n;
vector<char> c(n);
rep(i,0,n){
cin >> c[i];
}
auto calc = [&](auto self, int l, int r) -> S {
if (l + 1 == r){
if (c[l] == 'R'){
return {
{0, 0},
{0, 0},
{0, 0},
{0, 1}
};
}else{
return {
{0, 1},
{0, 0},
{0, 0},
{0, 0}
};
}
}
int m = (l + r) / 2;
S v1 = self(self, l, m);
S v2 = self(self, m, r);
S v3;
vector<mint> bb1 = convolution(v1.br, v2.bb);
vector<mint> bb2 = convolution(v1.bb, v2.rb);
vector<mint> rr1 = convolution(v1.rr, v2.br);
vector<mint> rr2 = convolution(v1.rb, v2.rr);
vector<mint> br1 = convolution(v1.bb, v2.rr);
vector<mint> br2 = convolution(v1.br, v2.br);
vector<mint> rb1 = convolution(v1.rr, v2.bb);
vector<mint> rb2 = convolution(v1.rb, v2.rb);
v3.bb = vector<mint>((int)bb1.size());
v3.br = vector<mint>((int)bb1.size());
v3.rb = vector<mint>((int)bb1.size());
v3.rr = vector<mint>((int)bb1.size());
rep(i,0,(int)bb1.size()){
v3.bb[i] = bb1[i] + bb2[i];
v3.rr[i] = rr1[i] + rr2[i];
v3.rb[i] = rb1[i] + rb2[i];
v3.br[i] = br1[i] + br2[i];
}
rep(i,0,(int)v1.bb.size()){
v3.bb[i] += v1.bb[i];
v3.rr[i] += v1.rr[i];
v3.br[i] += v1.br[i];
v3.rb[i] += v1.rb[i];
}
rep(i,0,(int)v2.bb.size()){
v3.bb[i] += v2.bb[i];
v3.rr[i] += v2.rr[i];
v3.br[i] += v2.br[i];
v3.rb[i] += v2.rb[i];
}
return v3;
};
S ans = calc(calc, 0, n);
vector<mint> anv(n+1);
assert((int)ans.bb.size() == n+1);
rep(i,0,n+1){
anv[i] = ans.bb[i] + ans.br[i] + ans.rr[i] + ans.rb[i];
}
rep(i,1,n+1){
cout << anv[i].val() << '\n';
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0