結果
| 問題 | No.1614 Majority Painting on Tree |
| ユーザー |
 Sumitacchan
|
| 提出日時 | 2021-07-21 22:56:28 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,003 ms / 5,000 ms |
| コード長 | 6,230 bytes |
| コンパイル時間 | 1,942 ms |
| コンパイル使用メモリ | 182,556 KB |
| 実行使用メモリ | 16,768 KB |
| 最終ジャッジ日時 | 2024-07-17 20:03:32 |
| 合計ジャッジ時間 | 34,894 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 45 |
ソースコード
#include <bits/stdc++.h>using namespace std;//using namespace atcoder;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define chmax(a, b) a = max(a, b)#define chmin(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout <<endl;} }#define pb push_back#define fi first#define se second#define int long long#define INF 1000000000000000000template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout <<endl; }; return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }template<typename T> void Out(T x) { cout << x << endl; }template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using v_bool = vector<bool>;using v_Pii = vector<Pii>;//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};//char d[4] = {'D','R','U','L'};//const int mod = 1000000007;const int mod = 998244353;template<long long MOD>struct ModInt{using ll = long long;ll val;void setval(ll v) { val = v % MOD; };ModInt(): val(0) {}ModInt(ll v) { setval(v); };ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }ModInt operator/(const ModInt &x) const { return *this * x.inv(); }ModInt operator-() const { return ModInt(MOD - val); }ModInt operator+=(const ModInt &x) { return *this = *this + x; }ModInt operator-=(const ModInt &x) { return *this = *this - x; }ModInt operator*=(const ModInt &x) { return *this = *this * x; }ModInt operator/=(const ModInt &x) { return *this = *this / x; }bool operator==(const ModInt &x) const { return (*this).val == x.val; }friend ostream& operator<<(ostream &os, const ModInt &x) { os << x.val; return os; }friend istream& operator>>(istream &is, ModInt &x) { is >> x.val; x.val = (x.val % MOD + MOD) % MOD; return is; }ModInt pow(ll n) const {ModInt a = 1;if(n == 0) return a;int i0 = 64 - __builtin_clzll(n);for(int i = i0 - 1; i >= 0; i--){a = a * a;if((n >> i) & 1) a *= (*this);}return a;}ModInt inv() const { return this->pow(MOD - 2); }};using mint = ModInt<mod>; mint pow(mint x, long long n) { return x.pow(n); }//using mint = double; //for debugusing mvec = vector<mint>;using mmat = vector<mvec>;struct Combination{vector<mint> fact, invfact;Combination(int N){fact = vector<mint>({mint(1)});invfact = vector<mint>({mint(1)});fact_initialize(N);}Combination(){}void fact_initialize(int N){int i0 = fact.size();if(i0 >= N + 1) return;fact.resize(N + 1);invfact.resize(N + 1);for(int i = i0; i <= N; i++) fact[i] = fact[i - 1] * i;invfact[N] = (mint)1 / fact[N];for(int i = N - 1; i >= i0; i--) invfact[i] = invfact[i + 1] * (i + 1);}mint nCr(int n, int r){if(n < 0 || r < 0 || r > n) return mint(0);if(fact.size() < n + 1) fact_initialize(n);return fact[n] * invfact[r] * invfact[n - r];}mint nPr(int n, int r){if(n < 0 || r < 0 || r > n) return mint(0);if(fact.size() < n + 1) fact_initialize(n);return fact[n] * invfact[n - r];}mint Catalan(int n){if(n < 0) return 0;else if(n == 0) return 1;if(fact.size() < 2 * n + 1) fact_initialize(2 * n);return fact[2 * n] * invfact[n + 1] * invfact[n];}};Combination C;mint valid_num(int n, int M){mint ans = pow((mint)M, n);REP(i, n) if(2 * i > n) ans -= C.nCr(n, i) * pow((mint)(M - 1), n - i) * M;return ans;}struct edge{int to, cost, id;};class Graph{public:int N;vector<vector<edge>> G;mvec dp;int M; mint invM;Graph(int N): N(N){G = vector<vector<edge>>(N, vector<edge>(0));dp = mvec(N, 0);}void add_Directed_edge(int from, int to, int cost = 1, int id = 0){G[from].push_back(edge({to, cost, id}));}void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){add_Directed_edge(v1, v2, cost, id);add_Directed_edge(v2, v1, cost, id);}void dfs(int v, int p = -1){dp[v] = 1;for(auto e: G[v]) if(e.to != p){dfs(e.to, v);dp[v] *= dp[e.to];}dp[v] *= valid_num(SZ(G[v]), M);if(p != -1) dp[v] *= invM;}};signed main(){int N, M; cin >> N >> M;C = Combination(N);Graph G(N);REP(i, N - 1){int a, b; cin >> a >> b;a--; b--;G.add_Undirected_edge(a, b);}mint ans = 0;REP(i, M){G.M = M - i;G.invM = ((mint)(M - i)).inv();G.dfs(0);mint t = G.dp[0] * C.nCr(M, i);if(i % 2 == 0) ans += t;else ans -= t;}Out(ans);return 0;}