結果
問題 | No.1302 Random Tree Score |
ユーザー |
![]() |
提出日時 | 2020-11-28 02:07:27 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 514 ms / 3,000 ms |
コード長 | 3,607 bytes |
コンパイル時間 | 6,142 ms |
コンパイル使用メモリ | 273,276 KB |
実行使用メモリ | 20,252 KB |
最終ジャッジ日時 | 2024-09-12 21:46:15 |
合計ジャッジ時間 | 10,956 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}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];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifusing namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = 1<<30;const ll linf = 1LL<<62;const int MAX = 510000;int dy[8] = {0,-1,0,1,1,-1,-1,1};int dx[8] = {-1,0,1,0,1,-1,1,-1};const double pi = acos(-1);const double eps = 1e-7;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){int sz = a.size();for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr;sz--;if(sz) cout << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}//const int mod = 1e9 + 7;const int mod = 998244353;vector<ll> fac(MAX), finv(MAX), inv(MAX);void comInit(){fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for(ll i=2; i<MAX; i++){fac[i] = fac[i-1]*i % mod;inv[i] = mod - inv[mod%i] * (mod/i) % mod;finv[i] = finv[i-1] * inv[i] % mod;}}ll com(ll n, ll k){if(n < k) return 0;if(n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n-k] % mod) % mod;}ll modpow(ll x, ll n, ll mod){ll res = 1;while(n > 0){if(n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}using mint = modint998244353;int main(){ll n; cin >> n;vector<mint> a(n);comInit();rep(i,n-1){a[i] = finv[i] * (i+1) % mod;}auto polypow = [](vector<mint> &a, ll N) -> vector<mint> {int n = a.size();vector<mint> res(n,0);res[0] = 1;while(N > 0){if(N & 1) res = convolution(res,a);a = convolution(a,a);while(res.size() > n-1) res.pop_back();while(a.size() > n-1) a.pop_back();N >>= 1;}return res;};auto b = polypow(a,n);mint ans = b[n-2] * fac[n-2] / modpow(n,n-2,mod);cout << ans.val() << "\n";}