結果

問題 No.1103 Directed Length Sum
ユーザー stoqstoq
提出日時 2020-07-04 02:41:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 577 ms / 3,000 ms
コード長 5,087 bytes
コンパイル時間 2,240 ms
コンパイル使用メモリ 205,376 KB
実行使用メモリ 121,596 KB
最終ジャッジ日時 2024-09-17 07:09:20
合計ジャッジ時間 8,640 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 12 ms
27,940 KB
testcase_01 AC 12 ms
27,804 KB
testcase_02 AC 332 ms
121,596 KB
testcase_03 AC 171 ms
32,068 KB
testcase_04 AC 316 ms
36,888 KB
testcase_05 AC 577 ms
43,624 KB
testcase_06 AC 198 ms
33,696 KB
testcase_07 AC 42 ms
29,268 KB
testcase_08 AC 65 ms
29,932 KB
testcase_09 AC 31 ms
28,696 KB
testcase_10 AC 92 ms
30,780 KB
testcase_11 AC 357 ms
37,644 KB
testcase_12 AC 199 ms
33,836 KB
testcase_13 AC 102 ms
30,992 KB
testcase_14 AC 27 ms
28,496 KB
testcase_15 AC 156 ms
32,620 KB
testcase_16 AC 401 ms
38,892 KB
testcase_17 AC 417 ms
39,388 KB
testcase_18 AC 94 ms
30,740 KB
testcase_19 AC 362 ms
37,960 KB
testcase_20 AC 34 ms
28,928 KB
testcase_21 AC 62 ms
29,768 KB
testcase_22 AC 284 ms
36,024 KB
testcase_23 AC 170 ms
32,744 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:259:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  259 | main()
      | ^~~~
main.cpp: In function 'void solve()':
main.cpp:255:6: warning: 'root' may be used uninitialized [-Wmaybe-uninitialized]
  255 |   dfs(root, -1);
      |   ~~~^~~~~~~~~~
main.cpp:247:7: note: 'root' was declared here
  247 |   int root;
      |       ^~~~

ソースコード

diff # 

#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

#pragma region mint
template <int MOD>
struct Fp
{
  long long val;

  constexpr Fp(long long v = 0) noexcept : val(v % MOD)
  {
    if (val < 0)
      v += 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;
    if (val < 0)
      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 istream &operator>>(istream &is, Fp<MOD> &x) noexcept
  {
    return is >> x.val;
  }
};

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;
}

using mint = Fp<MOD>;
#pragma endregion

vector<int> E[1000010];
mint ans = 0;
pair<ll, ll> dfs(int v, int p)
{
  ll sum = 0, cnt = 0;
  for (auto c : E[v])
  {
    if (c == p)
      continue;
    auto [d, t] = dfs(c, v);
    sum += d;
    cnt += t;
  }
  ans += sum;
  cnt++, sum += cnt;
  return MP(sum, cnt);
}

void solve()
{
  int n;
  cin >> n;
  bool in_cnt[1000010] = {};
  rep(i, n - 1)
  {
    int a, b;
    cin >> a >> b;
    a--, b--;
    E[a].emplace_back(b);
    in_cnt[b] = true;
  }
  int root;
  rep(i, n)
  {
    if (in_cnt[i])
      continue;
    root = i;
    break;
  }
  dfs(root, -1);
  cout << ans << "\n";
}

main()
{
  init_main();
  solve();
}
0