結果
問題 | No.1103 Directed Length Sum |
ユーザー | batsumaru |
提出日時 | 2020-07-03 22:43:46 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,020 ms / 3,000 ms |
コード長 | 3,955 bytes |
コンパイル時間 | 1,611 ms |
コンパイル使用メモリ | 171,656 KB |
実行使用メモリ | 108,872 KB |
最終ジャッジ日時 | 2024-09-17 04:25:40 |
合計ジャッジ時間 | 11,054 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
27,040 KB |
testcase_01 | AC | 11 ms
26,936 KB |
testcase_02 | AC | 701 ms
108,872 KB |
testcase_03 | AC | 457 ms
35,000 KB |
testcase_04 | AC | 545 ms
37,936 KB |
testcase_05 | AC | 1,020 ms
46,376 KB |
testcase_06 | AC | 335 ms
33,984 KB |
testcase_07 | AC | 74 ms
28,416 KB |
testcase_08 | AC | 111 ms
29,420 KB |
testcase_09 | AC | 49 ms
27,996 KB |
testcase_10 | AC | 159 ms
30,328 KB |
testcase_11 | AC | 592 ms
39,040 KB |
testcase_12 | AC | 317 ms
34,268 KB |
testcase_13 | AC | 152 ms
30,612 KB |
testcase_14 | AC | 38 ms
27,668 KB |
testcase_15 | AC | 249 ms
32,468 KB |
testcase_16 | AC | 659 ms
40,584 KB |
testcase_17 | AC | 722 ms
41,264 KB |
testcase_18 | AC | 165 ms
30,300 KB |
testcase_19 | AC | 606 ms
39,492 KB |
testcase_20 | AC | 57 ms
28,080 KB |
testcase_21 | AC | 100 ms
29,148 KB |
testcase_22 | AC | 500 ms
36,996 KB |
testcase_23 | AC | 266 ms
32,816 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef pair<ll, ll> P;#define DUMP(x) cout << #x << " = " << (x) << endl;#define FOR(i, m, n) for (ll i = m; i < n; i++)#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)#define REP(i, n) FOR(i, 0, n)#define IREP(i, n) IFOR(i, 0, n)#define FOREACH(x, a) for (auto&(x) : (a))#define ALL(v) (v).begin(), (v).end()#define SZ(x) ll(x.size())// modinttemplate <int MOD>struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }constexpr Fp operator+(const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator-(const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator*(const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator/(const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator+=(const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator-=(const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator*=(const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator/=(const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator==(const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator!=(const Fp& r) const noexcept {return this->val != r.val;}friend constexpr ostream& operator<<(ostream& os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD>& a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};// binomial coefficienttemplate <class T>struct BiCoef {vector<T> fact_, inv_, finv_;constexpr BiCoef() {}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {init(n);}constexpr void init(int n) noexcept {fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].getmod();for (int i = 2; i < n; i++) {fact_[i] = fact_[i - 1] * i;inv_[i] = -inv_[MOD % i] * (MOD / i);finv_[i] = finv_[i - 1] * inv_[i];}}constexpr T com(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;if (n <= (int)fact_.size() - 1) {return fact_[n] * finv_[k] * finv_[n - k];}// C(n,k), n <= 1e9, k <= 1e6T res = 1;for (int i = n; i >= n - k + 1; i--) {T a = i;res *= a;}res *= finv_[k];return res;}constexpr T fact(int n) const noexcept {if (n < 0) return 0;return fact_[n];}constexpr T inv(int n) const noexcept {if (n < 0) return 0;return inv_[n];}constexpr T finv(int n) const noexcept {if (n < 0) return 0;return finv_[n];}};const int MOD = 1000000007;// const int MOD = 998244353;using mint = Fp<MOD>;BiCoef<mint> bc;int n;vector<int> to[1001001];vector<mint> cnt;mint ans = 0;mint calc(int cv, int depth) {if (SZ(to[cv]) == 0) {ans += depth - 1;return (mint)1;}mint res = 0;for (int nv : to[cv]) {res += calc(nv, depth + 1);}res += 1;ans += res * (depth - 1);return res;}int main() {cin >> n;int r = -1;vector<int> indeg(n, 0);REP(i, n - 1) {int a, b;cin >> a >> b;a--, b--;to[a].push_back(b);indeg[b]++;}REP(i, n) {if (indeg[i] == 0) {r = i;}}calc(r, 1);cout << ans << endl;}