結果
問題 | No.1103 Directed Length Sum |
ユーザー | iiljj |
提出日時 | 2020-07-03 22:56:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 695 ms / 3,000 ms |
コード長 | 10,065 bytes |
コンパイル時間 | 2,475 ms |
コンパイル使用メモリ | 212,852 KB |
実行使用メモリ | 157,604 KB |
最終ジャッジ日時 | 2024-09-17 04:38:25 |
合計ジャッジ時間 | 9,293 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 318 ms
157,604 KB |
testcase_03 | AC | 202 ms
97,016 KB |
testcase_04 | AC | 352 ms
62,928 KB |
testcase_05 | AC | 695 ms
106,436 KB |
testcase_06 | AC | 229 ms
42,012 KB |
testcase_07 | AC | 39 ms
12,404 KB |
testcase_08 | AC | 68 ms
17,456 KB |
testcase_09 | AC | 22 ms
8,960 KB |
testcase_10 | AC | 106 ms
22,656 KB |
testcase_11 | AC | 425 ms
68,204 KB |
testcase_12 | AC | 228 ms
42,400 KB |
testcase_13 | AC | 103 ms
23,292 KB |
testcase_14 | AC | 17 ms
7,552 KB |
testcase_15 | AC | 178 ms
33,708 KB |
testcase_16 | AC | 492 ms
76,172 KB |
testcase_17 | AC | 515 ms
79,380 KB |
testcase_18 | AC | 101 ms
22,660 KB |
testcase_19 | AC | 451 ms
69,772 KB |
testcase_20 | AC | 29 ms
10,240 KB |
testcase_21 | AC | 62 ms
16,000 KB |
testcase_22 | AC | 363 ms
57,716 KB |
testcase_23 | AC | 189 ms
35,780 KB |
ソースコード
/* #region Head */ #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; template <class T> using vc = vector<T>; template <class T> using vvc = vc<vc<T>>; using vll = vc<ll>; using vvll = vvc<ll>; using vld = vc<ld>; using vvld = vvc<ld>; using vs = vc<string>; using vvs = vvc<string>; template <class T, class U> using um = unordered_map<T, U>; template <class T> using pq = priority_queue<T>; template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>; template <class T> using us = unordered_set<T>; #define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i)) #define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i)) #define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i)) #define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d)) #define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d)) #define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) #define ALL(x) begin(x), end(x) #define SIZE(x) ((ll)(x).size()) #define PERM(c) \ sort(ALL(c)); \ for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c))) #define UNIQ(v) v.erase(unique(ALL(v)), v.end()); #define endl '\n' #define sqrt sqrtl #define floor floorl #define log2 log2l constexpr ll INF = 1'010'000'000'000'000'017LL; constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7 constexpr ld EPS = 1e-12; constexpr ld PI = 3.14159265358979323846; template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力 for (T &x : vec) is >> x; return is; } template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump) os << "{"; REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", "); os << "}"; return os; } template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline) REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " "); return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力 is >> pair_var.first >> pair_var.second; return is; } template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力 os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } // map, um, set, us 出力 template <class T> ostream &out_iter(ostream &os, T &map_var) { os << "{"; REPI(itr, map_var) { os << *itr; auto itrcp = itr; if (++itrcp != map_var.end()) os << ", "; } return os << "}"; } template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); } template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { os << "{"; REPI(itr, map_var) { auto [key, value] = *itr; os << "(" << key << ", " << value << ")"; auto itrcp = itr; if (++itrcp != map_var.end()) os << ", "; } os << "}"; return os; } template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); } template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); } template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) { pq<T> pq_cp(pq_var); os << "{"; if (!pq_cp.empty()) { os << pq_cp.top(), pq_cp.pop(); while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop(); } return os << "}"; } // dump #define DUMPOUT cerr void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) DUMPOUT << ", "; dump_func(move(tail)...); } // chmax (更新「される」かもしれない値が前) template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) { if (comp(xmax, x)) { xmax = x; return true; } return false; } // chmin (更新「される」かもしれない値が前) template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) { if (comp(x, xmin)) { xmin = x; return true; } return false; } // ローカル用 #define DEBUG_ #ifdef DEBUG_ #define DEB #define dump(...) \ DUMPOUT << " " << string(#__VA_ARGS__) << ": " \ << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \ << " ", \ dump_func(__VA_ARGS__) #else #define DEB if (false) #define dump(...) #endif struct AtCoderInitialize { static constexpr int IOS_PREC = 15; static constexpr bool AUTOFLUSH = false; AtCoderInitialize() { ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); cout << fixed << setprecision(IOS_PREC); if (AUTOFLUSH) cout << unitbuf; } } ATCODER_INITIALIZE; void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; } void YN(bool p) { cout << (p ? "YES" : "NO") << endl; } /* #endregion */ /* #region Graph */ // エッジ(本来エッジは双方向だが,ここでは単方向で管理) template <class weight_t, class flow_t> struct Edge { ll src; // エッジ始点となる頂点 ll dst; // エッジ終点となる頂点 weight_t weight; // 重み flow_t cap; Edge() : src(0), dst(0), weight(0) {} Edge(ll src, ll dst, weight_t weight) : src(src), dst(dst), weight(weight) {} Edge(ll src, ll dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {} // Edge 標準出力 friend ostream &operator<<(ostream &os, Edge &edge) { os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")"; return os; } }; // 同じ頂点を始点とするエッジ集合 template <class weight_t, class flow_t> class Node : public vc<Edge<weight_t, flow_t>> { public: ll idx; Node() : vc<Edge<weight_t, flow_t>>() {} // void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); }; }; // graph[i] := 頂点 i を始点とするエッジ集合 template <class weight_t, class flow_t> class Graph : public vc<Node<weight_t, flow_t>> { public: Graph() : vc<Node<weight_t, flow_t>>() {} Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; } // 単方向 void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); } // 双方向 void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); } }; // using Array = vc<Weight>; // using Matrix = vc<Array>; /* #endregion */ /* #region mint */ // 自動で MOD を取る整数 struct mint { ll x; mint(ll x = 0) : x((x % MOD + MOD) % MOD) {} mint &operator+=(const mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint &operator-=(const mint a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } mint &operator*=(const mint a) { (x *= a.x) %= MOD; return *this; } mint operator+(const mint a) const { mint res(*this); return res += a; } mint operator-(const mint a) const { mint res(*this); return res -= a; } mint operator*(const mint a) const { mint res(*this); return res *= a; } // O(log(t)) mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); // ⌊t/2⌋ 乗 a *= a; // ⌊t/2⌋*2 乗 if (t & 1) // ⌊t/2⌋*2 == t-1 のとき a *= *this; // ⌊t/2⌋*2+1 乗 => t 乗 return a; } // for prime mod mint inv() const { return pow(MOD - 2); // オイラーの定理から, x^(-1) ≡ x^(p-2) } mint &operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res /= a; } bool operator==(const mint a) const { return this->x == a.x; } bool operator==(const ll a) const { return this->x == a; } // mint 入力 friend istream &operator>>(istream &is, mint &x) { is >> x.x; return is; } // mint 出力 friend ostream &operator<<(ostream &os, mint x) { os << x.x; return os; } }; /* #endregion */ // Problem void solve() { ll n; cin >> n; vll a(n - 1), b(n - 1); REP(i, 0, n - 1) { cin >> a[i] >> b[i]; --a[i], --b[i]; } Graph<ll, ll> g(n); REP(i, 0, n - 1) g.add_arc(a[i], b[i]); // root を探す ll root = -1; vll incount(n, 0); REP(i, 0, n - 1) incount[b[i]]++; REP(i, 0, n) if (incount[i] == 0) { root = i; break; } // ある辺について,子孫ノードの個数×祖先ノードの個数 vc<mint> tbl(n, 0); auto dfs = [&](auto &&dfs, mint num, ll idx) -> mint { mint nc = 1; for (Edge<ll, ll> &edge : g[idx]) { mint tnc = dfs(dfs, num + 1, edge.dst); // edge.dst の子ノード数 nc += tnc; } tbl[idx] = num * nc; return nc; }; dfs(dfs, 0, root); // dump(root, tbl); cout << accumulate(ALL(tbl), mint(0)) << endl; } // entry point int main() { solve(); return 0; }