結果

問題 No.1103 Directed Length Sum
ユーザー 👑 emthrmemthrm
提出日時 2020-07-03 22:03:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 794 ms / 3,000 ms
コード長 4,724 bytes
コンパイル時間 2,137 ms
コンパイル使用メモリ 210,672 KB
実行使用メモリ 139,924 KB
最終ジャッジ日時 2024-09-17 01:20:26
合計ジャッジ時間 9,608 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 410 ms
139,924 KB
testcase_03 AC 210 ms
34,716 KB
testcase_04 AC 408 ms
27,776 KB
testcase_05 AC 794 ms
45,708 KB
testcase_06 AC 245 ms
19,200 KB
testcase_07 AC 37 ms
7,040 KB
testcase_08 AC 63 ms
9,088 KB
testcase_09 AC 25 ms
5,760 KB
testcase_10 AC 91 ms
11,264 KB
testcase_11 AC 492 ms
29,948 KB
testcase_12 AC 260 ms
19,232 KB
testcase_13 AC 119 ms
11,400 KB
testcase_14 AC 18 ms
6,944 KB
testcase_15 AC 178 ms
15,932 KB
testcase_16 AC 529 ms
33,284 KB
testcase_17 AC 558 ms
34,616 KB
testcase_18 AC 107 ms
11,240 KB
testcase_19 AC 447 ms
30,636 KB
testcase_20 AC 29 ms
6,940 KB
testcase_21 AC 61 ms
8,576 KB
testcase_22 AC 375 ms
25,604 KB
testcase_23 AC 178 ms
16,668 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) const {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
  ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
  ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
  ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return ModInt(0);
    return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
  }
};

int main() {
  int n; cin >> n;
  vector<vector<int>> graph(n);
  vector is_root(n, true);
  REP(_, n - 1) {
    int a, b; cin >> a >> b; --a; --b;
    graph[a].emplace_back(b);
    is_root[b] = false;
  }
  vector<int> sub(n, 1);
  function<void(int)> dfs1 = [&](int ver) {
    for (int e : graph[ver]) {
      dfs1(e);
      sub[ver] += sub[e];
    }
  };
  ModInt ans = 0;
  function<void(int, int)> dfs2 = [&](int ver, int wei) {
    for (int e : graph[ver]) {
      ans += ModInt(wei + 1) * sub[e];
      // cout << ver << ' ' << e << " : " << wei + 1 << ' ' << sub[e] << '\n';
      dfs2(e, wei + 1);
    }
  };
  REP(i, n) {
    if (is_root[i]) {
      dfs1(i);
      dfs2(i, 0);
    }
  }
  cout << ans << '\n';
  return 0;
}
0