結果
問題 | No.2528 pop_(backfront or not) |
ユーザー |
![]() |
提出日時 | 2023-11-03 21:54:08 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 266 ms / 2,000 ms |
コード長 | 4,109 bytes |
コンパイル時間 | 10,638 ms |
コンパイル使用メモリ | 295,708 KB |
最終ジャッジ日時 | 2025-02-17 18:09:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 19 |
ソースコード
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <iostream>#include <iomanip>#include <string>#include <cmath>#include <algorithm>#include <vector>#include <set>#include <map>#include <unordered_map>#include <unordered_set>#include <list>#include <stack>#include <queue>#include <bitset>#include <numeric>#include <cassert>#include <memory>#include <random>#include <functional>#include <complex>#include <immintrin.h>#include <stdexcept>#ifdef DEBUG#include "./CompetitiveProgrammingCpp/Utils/debug.hpp"#include "./CompetitiveProgrammingCpp/Utils/Timer.hpp"#include "./CompetitiveProgrammingCpp/Utils/sample.hpp"#else#define dump(...)template<class T>constexpr inline auto d_val(T a, T b) { return a; }#endif/* macro */#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)#define REP(i, n) FOR(i, 0, (n))#define RREP(i, n) RFOR(i, 0, (n))#define REPC(x,c) for(const auto& x:(c))#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)#define REPI(it,c) REPI2(it, (c).begin(), (c).end())#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())#define ALL(x) (x).begin(),(x).end()/* macro func */template<class T>inline auto sort(T& t) { std::sort(ALL(t)); }template<class T>inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }template<class T, class S>inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }template<class T, class S>inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }inline auto BR() { std::cout << "\n"; }/* type define */using ll = long long;template<class T>using V = std::vector<T>;using VS = V<std::string>;using VL = V<ll>;using VVL = V<VL>;template<class T = ll, class U = T>using P = std::pair<T, U>;using PAIR = P<ll>;/* using std */using std::cout;using std::cin;using std::cerr;constexpr char endl = '\n';/* Initial processing */struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;/* define hash */constexpr unsigned int static_random() { return 1u * __TIME__[0] * __TIME__[1] * __TIME__[3] * __TIME__[4] * __TIME__[6] * __TIME__[7]; }template<class T> struct Hash { auto operator()(T x) const { return std::hash<T>()(x) ^ static_random(); } };template<> struct Hash<std::pair<int, int>> { auto operator()(const std::pair<int, int>& x) const { return Hash<long long>()(x.first << 31 | x.second); } };/* input */template<class T> std::istream& operator >> (std::istream& is, std::vector<T>& vec) { for(T& x : vec) is >> x; return is; }/* constant value */// constexpr ll MOD = 1000000007;constexpr ll MOD = 998244353;//=============================================================================================auto Y = [](auto f) {return [=](auto&&... args) {return f(f, std::forward<decltype(args)>(args)...);};};signed main() {ll n;cin >> n;ll size = (n << 1) + 1;VVL dp(n, VL(size, -1));auto solve = Y([&](auto&& self, ll i, ll j) -> ll {if(i == n) { return j == 0; }if(dp[i][j] > 0) { return dp[i][j]; }ll d = size - (i << 1);ll l = j - 1;ll r = d - j - 2;ll ret = 0;// cout << i << " " << j << ": " << l << " " << r << " " << d << endl;if(j != 0 && j != d - 1) { ret += self(self, i + 1, j - 1); }if(l >= 1 && r >= 1) { ret += self(self, i + 1, j - 1) * l % MOD * r % MOD; }if(l >= 2) { ret += (l * (l - 1) / 2) % MOD * self(self, i + 1, j - 2) % MOD; }if(r >= 2) { ret += (r * (r - 1) / 2) % MOD * self(self, i + 1, j) % MOD; }ret %= MOD;return dp[i][j] = ret;});REP(i, size) { cout << solve(0, i) << endl; }}