結果
問題 | No.1507 Road Blocked |
ユーザー | ビーサー |
提出日時 | 2021-05-14 23:06:49 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 3,722 bytes |
コンパイル時間 | 3,651 ms |
コンパイル使用メモリ | 238,116 KB |
実行使用メモリ | 18,816 KB |
最終ジャッジ日時 | 2024-10-02 03:49:48 |
合計ジャッジ時間 | 7,120 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 71 ms
18,816 KB |
testcase_04 | AC | 73 ms
11,628 KB |
testcase_05 | AC | 72 ms
11,520 KB |
testcase_06 | AC | 71 ms
11,512 KB |
testcase_07 | AC | 75 ms
11,520 KB |
testcase_08 | AC | 73 ms
11,520 KB |
testcase_09 | AC | 74 ms
11,520 KB |
testcase_10 | AC | 72 ms
11,648 KB |
testcase_11 | AC | 74 ms
11,520 KB |
testcase_12 | AC | 76 ms
11,520 KB |
testcase_13 | AC | 74 ms
11,520 KB |
testcase_14 | AC | 74 ms
11,520 KB |
testcase_15 | AC | 73 ms
11,520 KB |
testcase_16 | AC | 73 ms
11,520 KB |
testcase_17 | AC | 73 ms
11,520 KB |
testcase_18 | AC | 72 ms
11,520 KB |
testcase_19 | AC | 72 ms
11,540 KB |
testcase_20 | AC | 73 ms
11,520 KB |
testcase_21 | AC | 75 ms
11,520 KB |
testcase_22 | AC | 73 ms
11,520 KB |
testcase_23 | AC | 75 ms
11,648 KB |
testcase_24 | AC | 74 ms
11,520 KB |
testcase_25 | AC | 74 ms
11,520 KB |
testcase_26 | AC | 72 ms
11,520 KB |
testcase_27 | AC | 72 ms
11,520 KB |
testcase_28 | AC | 72 ms
11,604 KB |
testcase_29 | AC | 75 ms
11,648 KB |
testcase_30 | AC | 74 ms
11,520 KB |
testcase_31 | AC | 73 ms
11,520 KB |
testcase_32 | AC | 73 ms
11,520 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using ll = long long; struct Edge { ll to; ll cost; }; using Graph = vector<vector<ll>>; using P = pair<ll, ll>; #define mp make_pair #define REP(i, n) for (int i = 0; i < (n); ++i) #define SORT(v) sort((v).begin(), (v).end()) #define RSORT(v) sort((v).rbegin(), (v).rend()) #define ALL(v) (v).begin(), v.end() ll MOD = 998244353; const ll nmax = 8; const ll INF = 1e10; const int MAX = 510000; bool graph[nmax][nmax]; long long fac[MAX], finv[MAX], inv[MAX]; void Case(int i) { printf("Case #%d: ", i); } void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int 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(int n, int k) { if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF)); void warshall_floyd(ll n) { for (size_t i = 0; i < n; i++) { for (size_t j = 0; j < n; j++) { for (size_t k = 0; k < n; k++) { dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]); } } } } ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; } ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); } ll powMod(ll a, ll p) { if (p == 0) { return 1; } else if (p % 2 == 0) { ll half = powMod(a, p / 2); return mulMod(half, half); } else { return mulMod(powMod(a, p - 1), a); } } ll ceil(ll a, ll b) { return (a + b - 1) / b; } bool isPrime(ll N) { for (int i = 2; i * i <= N; i++) { if (N % i == 0) return false; } return true; } ll cntbit(ll i) { if (i == 0) return 0; ll ret = 0; i++; while (i != 0) { i = i >> 1; ret++; } return ret - 1; } ll getSize(ll a) { ll ret = 0; while (a != 0) { ret++; a /= 10; } return ret; } vector<pair<long long, long long>> prime_factorize(long long N) { vector<pair<long long, long long>> res; for (long long a = 2; a * a <= N; ++a) { if (N % a != 0) continue; long long ex = 0; while (N % a == 0) { ++ex; N /= a; } res.push_back({a, ex}); } if (N != 1) res.push_back({N, 1}); return res; } using mint = atcoder::modint998244353; vector<ll> dp; void dfs(Graph &G, int v, int p) { dp[v] = 1; for (auto &&i : G[v]) { if (i != p) { dfs(G, i, v); dp[v] += dp[i]; } } } int main() { ll N; cin >> N; Graph G(N); vector<ll> A(N), B(N); for (int i = 0; i < N - 1; i++) { ll a, b; cin >> a >> b; --a; --b; A[i] = a; B[i] = b; G[a].push_back(b); G[b].push_back(a); } dp.assign(N, 0); mint q = N; q *= N - 1; q *= N - 1; q /= 2; dfs(G, 0, -1); mint p = 0; for (int i = 0; i < N; i++) { ll r = min(dp[A[i]], dp[B[i]]); p += r * (N - r); } // cout << p.val() << " " << q.val() << endl; // if (p.val() == 0) // { // cout << 0 << endl; // return 0; // } p = q - p; mint r = p * q.inv(); cout << r.val() << endl; return 0; }