結果
問題 | No.1302 Random Tree Score |
ユーザー | heno239 |
提出日時 | 2020-11-27 23:41:59 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,683 ms / 3,000 ms |
コード長 | 5,043 bytes |
コンパイル時間 | 2,158 ms |
コンパイル使用メモリ | 136,484 KB |
実行使用メモリ | 77,248 KB |
最終ジャッジ日時 | 2024-09-13 01:17:40 |
合計ジャッジ時間 | 12,434 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
6,816 KB |
testcase_01 | AC | 4 ms
6,816 KB |
testcase_02 | AC | 220 ms
15,376 KB |
testcase_03 | AC | 724 ms
43,448 KB |
testcase_04 | AC | 183 ms
14,196 KB |
testcase_05 | AC | 1,683 ms
77,248 KB |
testcase_06 | AC | 827 ms
44,536 KB |
testcase_07 | AC | 172 ms
16,548 KB |
testcase_08 | AC | 1,091 ms
41,408 KB |
testcase_09 | AC | 721 ms
44,764 KB |
testcase_10 | AC | 771 ms
39,256 KB |
testcase_11 | AC | 134 ms
11,064 KB |
testcase_12 | AC | 1,144 ms
51,748 KB |
testcase_13 | AC | 5 ms
6,944 KB |
testcase_14 | AC | 719 ms
43,780 KB |
testcase_15 | AC | 1,108 ms
44,492 KB |
testcase_16 | AC | 5 ms
6,940 KB |
ソースコード
#pragma GCC optimize("Ofast") #pragma GCC target ("sse4") #include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 17; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } int get_premitive_root() { int primitive_root = 0; if (!primitive_root) { primitive_root = [&]() { set<int> fac; int v = mod - 1; for (ll i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i; if (v > 1) fac.insert(v); for (int g = 1; g < mod; g++) { bool ok = true; for (auto i : fac) if (mod_pow(g, (mod - 1) / i) == 1) { ok = false; break; } if (ok) return g; } return -1; }(); } return primitive_root; } const int proot = get_premitive_root(); typedef vector <modint> poly; void dft(poly& f, bool inverse = false) { int n = f.size(); if (n == 1)return; static poly w{ 1 }, iw{ 1 }; for (int m = w.size(); m < n / 2; m *= 2) { modint dw = mod_pow(proot, (mod - 1) / (4 * m)), dwinv = (modint)1 / dw; w.resize(m * 2); iw.resize(m * 2); for (int i = 0; i < m; i++)w[m + i] = w[i] * dw, iw[m + i] = iw[i] * dwinv; } if (!inverse) { for (int m = n; m >>= 1;) { for (int s = 0, k = 0; s < n; s += 2 * m, k++) { for (int i = s; i < s + m; i++) { modint x = f[i], y = f[i + m] * w[k]; f[i] = x + y, f[i + m] = x - y; } } } } else { for (int m = 1; m < n; m *= 2) { for (int s = 0, k = 0; s < n; s += 2 * m, k++) { for (int i = s; i < s + m; i++) { modint x = f[i], y = f[i + m]; f[i] = x + y, f[i + m] = (x - y) * iw[k]; } } } modint n_inv = (modint)1 / (modint)n; for (modint& v : f)v *= n_inv; } } poly multiply(poly g, poly h) { int n = 1; int pi = 0, qi = 0; rep(i, g.size())if (g[i])pi = i; rep(i, h.size())if (h[i])qi = i; int sz = pi + qi + 2; while (n < sz)n *= 2; g.resize(n); h.resize(n); dft(g); dft(h); rep(i, n) { g[i] *= h[i]; } dft(g, true); return g; } void solve() { int n; cin >> n; poly p(n - 1); rep(i, n - 1) { p[i] = (modint)(i + 1) / fact[i]; } poly x = { 1 }; int cop = n; while (cop > 0) { if (cop & 1)x = multiply(x, p); cop >>= 1; if (cop == 0)break; p = multiply(p, p); if (p.size() > n - 1)p.resize(n - 1); } modint ans = x[n - 2] * fact[n - 2]; ans = ans / (modint)mod_pow(n, n - 2); cout << ans<< "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }