結果
問題 | No.1766 Tatsujin Remix |
ユーザー |
👑 ![]() |
提出日時 | 2024-12-14 02:19:50 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 4,420 bytes |
コンパイル時間 | 5,815 ms |
コンパイル使用メモリ | 227,608 KB |
実行使用メモリ | 29,568 KB |
最終ジャッジ日時 | 2024-12-14 02:20:01 |
合計ジャッジ時間 | 7,781 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 22 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}int main() {ll N;cin >> N;vector<string> S(N);for (ll i = 0; i < N; i++) {cin >> S[i];}string T = "";for (ll i = 0; i < N; i++) {T += S[i];}vector<vector<bool>> pos(N * 16, vector<bool>(3, true));for (ll i = 0; i < N * 16; i++) {if (T[i] == 'd') {pos[i][0] = false;pos[i][2] = false;}if (T[i] == 'k') {pos[i][0] = false;pos[i][1] = false;}if (T[i] == '.' && i < N * 16) {if (T[i + 1] == 'd') {pos[i][2] = false;}if (T[i + 1] == 'k') {pos[i][1] = false;}}}vector<vector<ll>> dp(N * 16, vector<ll>(3));for (ll i = 0; i < 3; i++) {if (pos[0][i]) {dp[0][i] = 1;}}for (ll i = 1; i < N * 16; i++) {if (i % 2 == 0) {for (ll j = 0; j < 3; j++) {if (pos[i][j]) {for (ll k = 0; k < 3; k++) {if (j == 0 && k != 0) {continue;}dp[i][j] += dp[i - 1][k];dp[i][j] %= mod2;}}}} else {for (ll j = 0; j < 3; j++) {if (pos[i][j]) {for (ll k = 0; k < 3; k++) {if (k == 0 && j != 0) {continue;}dp[i][j] += dp[i - 1][k];dp[i][j] %= mod2;}}}}}ll ans = 0;for (ll i = 0; i < 3; i++) {ans += dp[16 * N - 1][i];ans %= mod2;}cout << ans << endl;}