結果
問題 | No.2528 pop_(backfront or not) |
ユーザー |
|
提出日時 | 2023-11-03 22:44:10 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 612 ms / 2,000 ms |
コード長 | 3,938 bytes |
コンパイル時間 | 5,634 ms |
コンパイル使用メモリ | 318,420 KB |
実行使用メモリ | 19,072 KB |
最終ジャッジ日時 | 2024-09-25 21:08:39 |
合計ジャッジ時間 | 9,635 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 19 |
ソースコード
#include "bits/stdc++.h"#include <stdio.h>#include <math.h>#include "atcoder/all"#include <float.h>//#include <boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;// std::fixed << std::setprecision(10) <<using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using mint = modint998244353;using mint2 = modint1000000007;const double eps = 1e-9;#define REP(i, n) for (ll i = 0; i < ll(n); ++i)#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)#define REPD(i, init) for (ll i = init; i >=0; --i)#define REPDI(i, init, n) for (ll i = init; i >=n; --i)#define REPE(i, c) for (const auto& i : c)#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)using vl = vector<ll>; using vvl = vector<vector<ll>>;#define VL(a, n) vector<ll> a; a.assign(n, 0);#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);using vd = vector<double>;using pl = pair<ll, ll>;struct uv { ll u; ll v; ll c; };#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }template <class T = long long> using pql = priority_queue<T>;template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;using vm = vector<mint>; using vvm = vector<vm>;void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end()? V() : mp.at(key); }int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n;cin >> n;vector<vm> dp(n + 1, vm(n + 1, 0));dp[1][0] = 0;dp[1][1] = 1;REPI(i, 2, n+1) {mint ts = 0;REP(j, i + 1) {//左からj個目if (j == 0) {dp[i][j] = 0;continue;}//両端を取るパターンdp[i][j] += dp[i - 1][j - 1];ll left = j;ll right = i * 2 - j;if (left > 0 && right > 0) {dp[i][j] += dp[i - 1][j - 1] * (left - 1) * (right - 1);//左1つと右1つを取るパターン}if (left > 1) {//左2dp[i][j] += dp[i - 1][j - 2] * (left - 1) * (left - 2) / 2;}if (right > 1) {//右2ll tj = j;if (tj > i-1) tj = (i - 1)*2 - tj;dp[i][j] += dp[i - 1][tj] * (right - 1) * (right - 2)/2;}}}REP(i, n + 1) cout << dp[n][i].val() << endl;REP(i, n) cout << dp[n][n - i - 1].val() << endl;}