結果
問題 | No.1302 Random Tree Score |
ユーザー | minato |
提出日時 | 2020-11-27 23:23:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 504 ms / 3,000 ms |
コード長 | 4,234 bytes |
コンパイル時間 | 7,093 ms |
コンパイル使用メモリ | 317,716 KB |
実行使用メモリ | 16,384 KB |
最終ジャッジ日時 | 2024-09-13 01:04:47 |
合計ジャッジ時間 | 11,817 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 15 ms
10,996 KB |
testcase_01 | AC | 15 ms
10,988 KB |
testcase_02 | AC | 100 ms
12,560 KB |
testcase_03 | AC | 230 ms
13,956 KB |
testcase_04 | AC | 97 ms
12,536 KB |
testcase_05 | AC | 504 ms
16,180 KB |
testcase_06 | AC | 404 ms
16,320 KB |
testcase_07 | AC | 93 ms
12,604 KB |
testcase_08 | AC | 254 ms
14,056 KB |
testcase_09 | AC | 394 ms
16,380 KB |
testcase_10 | AC | 423 ms
16,016 KB |
testcase_11 | AC | 92 ms
12,432 KB |
testcase_12 | AC | 471 ms
16,220 KB |
testcase_13 | AC | 15 ms
11,076 KB |
testcase_14 | AC | 392 ms
16,384 KB |
testcase_15 | AC | 456 ms
16,256 KB |
testcase_16 | AC | 15 ms
10,996 KB |
ソースコード
#ifdef ONLINE_JUDGE #pragma GCC target("avx2,avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using pii = pair<int, int>; using pll = pair<long long, long long>; #define rep(i, n) for (int i = 0; i < (n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define all(x) (x).begin(), (x).end() constexpr char ln = '\n'; istream& operator>>(istream& is, __int128_t& x) { x = 0; string s; is >> s; int n = int(s.size()), it = 0; if (s[0] == '-') it++; for (; it < n; it++) x = (x * 10 + s[it] - '0'); if (s[0] == '-') x = -x; return is; } ostream& operator<<(ostream& os, __int128_t x) { if (x == 0) return os << 0; if (x < 0) os << '-', x = -x; deque<int> deq; while (x) deq.emplace_front(x % 10), x /= 10; for (int e : deq) os << e; return os; } template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << "(" << p.first << ", " << p.second << ")"; } template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; for (int i = 0; i < int(v.size()); i++) { if (i) os << ", "; os << v[i]; } return os << "}"; } template<class Container> inline int SZ(Container& v) { return int(v.size()); } template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;} template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;} inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } inline int popcount(ull x) { return __builtin_popcountll(x); } inline int kthbit(ull x, int k) { return (x>>k) & 1; } inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; } inline void print() { cout << "\n"; } template<class T> inline void print(const vector<T>& v) { for (int i = 0; i < int(v.size()); i++) { if (i) cout << " "; cout << v[i]; } print(); } template<class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL inline void debug_out() { cerr << endl; } template <class T, class... Args> inline void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include <atcoder/all> using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; //using mint = modint; struct ModCombination { vector<mint> Fac,Facinv; ModCombination(int x) { Fac.resize(x+1); Facinv.resize(x+1); Fac[0] = 1; for (int i = 0; i < x; ++i) Fac[i+1] = Fac[i]*(i+1); Facinv[x] = Fac[0]/Fac[x]; for (int i = x; i > 0; --i) Facinv[i-1] = Facinv[i]*i; } mint get(int n, int k) { if (k < 0 || k > n) return 0; return Fac[n]*Facinv[k]*Facinv[n-k]; } }; int main() { ModCombination MC(1000000); int N; cin >> N; vector<mint> p(N-1,1); for (int i = 0; i < N-1; i++) p[i] = MC.Facinv[i]*(i+1); int K = N; auto b = p; vector<mint> e(N-1); e[0] = 1; while (K) { if (K&1) { e = convolution(e,b); e.resize(N-1); } K >>= 1; b = convolution(b,b); b.resize(N-1); } //rep(i,N) debug(e[i].val()); e[N-2] *= MC.Fac[N-2]; mint q = mint(N).pow(N-2); cout << (e[N-2]/q).val() << ln; }