結果

問題 No.2668 Trees on Graph Paper
ユーザー ecotteaecottea
提出日時 2024-03-09 01:59:13
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 545 ms / 3,000 ms
コード長 6,795 bytes
コンパイル時間 4,320 ms
コンパイル使用メモリ 267,592 KB
実行使用メモリ 120,444 KB
最終ジャッジ日時 2024-09-29 21:05:58
合計ジャッジ時間 11,206 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
//using mint = modint998244353;
using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
void MLE() {
int n, m;
cin >> n >> m;
mint::set_mod(m);
int N = 2 * n - 2;
//vvm dp(N + 1, vm(3));
//dp[0][0] = 1;
//repi(i, 1, N) {
// if (i <= N - 2) {
// dp[i][0] += dp[i - 1][0] + dp[i - 1][1] + dp[i - 1][2];
// }
// if (1 <= i && i <= N - 1) {
// dp[i][1] += dp[i - 1][0] + dp[i - 1][1] + dp[i - 1][2];
// }
// if (2 <= i) {
// dp[i][2] += dp[i - 1][1] + dp[i - 1][2];
// }
//}
// dumpel(dp);
vvm dp2(N + 1, vm(3));
dp2[0][0] = 1;
repi(i, 1, N) {
if (i <= N - 2) {
dp2[i][0] += dp2[i - 1][0] + i * dp2[i - 1][1] + (i - 1) * dp2[i - 1][2] * i;
}
if (1 <= i && i <= N - 1) {
dp2[i][1] += dp2[i - 1][0] + dp2[i - 1][1] + (i - 1) * dp2[i - 1][2];
}
if (2 <= i) {
dp2[i][2] += dp2[i - 1][1] + dp2[i - 1][2];
}
}
// dumpel(dp2);
mint res = 1;
repi(i, 1, n - 1) {
res *= dp2[2 * i][2];
}
repi(i, 1, 2 * n - 1) res *= i;
cout << res << endl;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, m;
cin >> n >> m;
mint::set_mod(m);
int N = 2 * n - 2;
vm dp0(N + 1), dp1(N + 1), dp2(N + 1);
dp0[0] = 1;
repi(i, 1, N) {
if (i <= N - 2) {
dp0[i] += dp0[i - 1] + i * dp1[i - 1] + (i - 1) * dp2[i - 1] * i;
}
if (1 <= i && i <= N - 1) {
dp1[i] += dp0[i - 1] + dp1[i - 1] + (i - 1) * dp2[i - 1];
}
if (2 <= i) {
dp2[i] += dp1[i - 1] + dp2[i - 1];
}
}
// dumpel(dp2);
mint res = 1;
repi(i, 1, n - 1) {
res *= dp2[2 * i];
}
repi(i, 1, 2 * n - 1) res *= i;
cout << res << endl;
}
/*
0: 1 0 0
1: 1 1 0
2: 2 2 1
3: 0 5 3
4: 0 0 8
0: 1 0 0
1: 1 1 0
2: 2 2 1
3: 5 5 3
4: 13 13 8
5: 34 34 21
6: 89 89 55
7: 0 233 144
8: 0 0 377
*/
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0