結果
| 問題 | No.2874 Gunegune Tree |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2024-12-17 19:37:26 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 62 ms / 2,000 ms |
| コード長 | 4,347 bytes |
| コンパイル時間 | 19,442 ms |
| コンパイル使用メモリ | 262,284 KB |
| 最終ジャッジ日時 | 2025-02-26 15:11:26 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
#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>>>// using mint = modint998244353;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;ll inv_2 = (mod2 + 1) / 2;ll inv_3 = (mod2 + 1) / 3;ll inv_5 = (mod2 * 3LL + 1) / 5;vector<vector<ll>> dp(N, vector<ll>(5));vector<vector<ll>> dpr(N, vector<ll>(5));dp[0][0] = 0;dp[0][1] = inv_5;dp[0][2] = inv_5;dp[0][3] = inv_5;dp[0][4] = 0;for (ll i = 0; i < 5; i++) {dpr[0][i] = inv_5;}for (ll i = 0; i < N - 1; i++) {for (ll j = 0; j < 5; j++) {for (ll k = 0; k < 5; k++) {if (abs(j - k) > 1) {continue;}if (j >= 1 && j <= 3) {if (k >= 1 && k <= 3) {dp[i + 1][k] += ((dp[i][j] + dpr[i][j]) * inv_3) % mod2;dp[i + 1][k] %= mod2;} else {dp[i + 1][k] += (dp[i][j] * inv_3) % mod2;dp[i + 1][k] %= mod2;}dpr[i + 1][k] += (dpr[i][j] * inv_3) % mod2;dpr[i + 1][k] %= mod2;} else {if (k >= 1 && k <= 3) {dp[i + 1][k] += ((dp[i][j] + dpr[i][j]) * inv_2) % mod2;dp[i + 1][k] %= mod2;} else {dp[i + 1][k] += (dp[i][j] * inv_2) % mod2;dp[i + 1][k] %= mod2;}dpr[i + 1][k] += (dpr[i][j] * inv_2) % mod2;dpr[i + 1][k] %= mod2;}dp[i + 1][k] %= mod2;}}}ll ans = 0;for (ll j = 0; j < 5; j++) {ans = (ans + dp[N - 1][j]) % mod2;}cout << ans << endl;}