結果
問題 | No.2524 Stripes |
ユーザー |
![]() |
提出日時 | 2023-10-27 22:21:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 919 ms / 7,000 ms |
コード長 | 1,803 bytes |
コンパイル時間 | 3,196 ms |
コンパイル使用メモリ | 241,700 KB |
最終ジャッジ日時 | 2025-02-17 15:16:04 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/convolution>using namespace std;const long long MOD = 998244353;vector<long long> operator +(vector<long long> A, vector<long long> B){int N = A.size();int M = B.size();int mx = max(N, M);vector<long long> ans(mx, 0);for (int i = 0; i < N; i++){ans[i] += A[i];}for (int i = 0; i < M; i++){ans[i] += B[i];ans[i] %= MOD;}return ans;}vector<long long> operator *(vector<long long> A, vector<long long> B){return atcoder::convolution(A, B);}struct mat{array<array<vector<long long>, 2>, 2> f;mat(){for (int i = 0; i < 2; i++){for (int j = 0; j < 2; j++){f[i][j] = {0, 0};}}}array<vector<long long>, 2>& operator [](int i){return f[i];}};mat operator *(mat L, mat R){mat ans;ans[0][0] = L[0][0] + R[0][0] + L[0][0] * R[1][0] + L[0][1] * R[0][0];ans[0][1] = L[0][1] + R[0][1] + L[0][0] * R[1][1] + L[0][1] * R[0][1];ans[1][0] = L[1][0] + R[1][0] + L[1][0] * R[1][0] + L[1][1] * R[0][0];ans[1][1] = L[1][1] + R[1][1] + L[1][0] * R[1][1] + L[1][1] * R[0][1];return ans;}int main(){int N;cin >> N;string S;cin >> S;auto dfs = [&](auto dfs, int L, int R) -> mat {if (R - L == 1){mat ans;if (S[L] == 'R'){ans[0][0][1] = 1;}if (S[L] == 'B'){ans[1][1][1] = 1;}return ans;} else {int m = (L + R) / 2;return dfs(dfs, L, m) * dfs(dfs, m, R);}};mat p = dfs(dfs, 0, N);vector<long long> ans(N + 1, 0);for (int i = 0; i < 2; i++){for (int j = 0; j < 2; j++){for (int k = 0; k <= N; k++){ans[k] += p[i][j][k];ans[k] %= MOD;}}}for (int i = 1; i <= N; i++){cout << ans[i] << endl;}}