#516884 (C++17) No.1124 Earthquake Safety

• 問題: No.1124 Earthquake Safety
• ユーザー: opt
• 提出日時: 2020-07-23 00:43:44
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 261 ms / 3,000 ms
• コード長: 4,119 bytes
• コンパイル時間: 2,656 ms
• コンパイル使用メモリ: 209,968 KB
• 実行使用メモリ: 66,560 KB
• 最終ジャッジ日時: 2024-06-23 03:23:54
• 合計ジャッジ時間: 12,793 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	6 ms; 5,376 KB
testcase_08	AC	49 ms; 8,832 KB
testcase_09	AC	261 ms; 20,032 KB
testcase_10	AC	157 ms; 66,560 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	243 ms; 20,096 KB
testcase_15	AC	234 ms; 19,968 KB
testcase_16	AC	212 ms; 19,968 KB
testcase_17	AC	205 ms; 20,096 KB
testcase_18	AC	219 ms; 19,968 KB
testcase_19	AC	215 ms; 19,968 KB
testcase_20	AC	191 ms; 19,968 KB
testcase_21	AC	184 ms; 19,968 KB
testcase_22	AC	178 ms; 19,968 KB
testcase_23	AC	179 ms; 19,840 KB
testcase_24	AC	180 ms; 19,840 KB
testcase_25	AC	213 ms; 19,968 KB
testcase_26	AC	234 ms; 19,968 KB
testcase_27	AC	197 ms; 22,400 KB
testcase_28	AC	177 ms; 22,656 KB
testcase_29	AC	184 ms; 30,848 KB
testcase_30	AC	186 ms; 30,848 KB
testcase_31	AC	205 ms; 48,512 KB
testcase_32	AC	227 ms; 45,184 KB
testcase_33	AC	217 ms; 43,776 KB
testcase_34	AC	242 ms; 47,744 KB
testcase_35	AC	173 ms; 19,584 KB
testcase_36	AC	155 ms; 19,584 KB
testcase_37	AC	167 ms; 20,992 KB
testcase_38	AC	169 ms; 20,608 KB
testcase_39	AC	174 ms; 20,352 KB
testcase_40	AC	159 ms; 20,992 KB
testcase_41	AC	154 ms; 20,608 KB
testcase_42	AC	147 ms; 20,992 KB
testcase_43	AC	149 ms; 21,504 KB
testcase_44	AC	146 ms; 21,248 KB
testcase_45	AC	149 ms; 20,864 KB
testcase_46	AC	144 ms; 21,248 KB
testcase_47	AC	156 ms; 20,864 KB
testcase_48	AC	140 ms; 20,864 KB
testcase_49	AC	159 ms; 20,832 KB
testcase_50	AC	2 ms; 5,376 KB
testcase_51	AC	2 ms; 5,376 KB
testcase_52	AC	2 ms; 5,376 KB
testcase_53	AC	1 ms; 5,376 KB
testcase_54	AC	2 ms; 5,376 KB
testcase_55	AC	1 ms; 5,376 KB
testcase_56	AC	1 ms; 5,376 KB
testcase_57	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) (a).begin(), (a).end()
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline int sz(T &x) { return x.size(); }
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; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const int x) { return 31-__builtin_clz(x); } // floor(log2(x))
inline int fLog2(const ll x) { return 63-__builtin_clzll(x); }
inline int cLog2(const int x) { return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x))
inline int cLog2(const ll x) { return (x == 1) ? 0 : 64-__builtin_clzll(x-1); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF  = 1<<30;
const ll INFll = 1ll<<62;
const ld EPS   = 1e-10;
const ld PI    = acos(-1.0);
const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


struct mint {
  ll x;
  mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; }
  mint& operator-=(const mint a) { if ((x -= a.x) < 0) x += MOD; return *this; }
  mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this; }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  mint& operator/=(const mint r) {
    ll a = r.x, b = MOD, u = 1, v = 0;
    while (b) {
      ll t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    x = x * u % MOD;
    if (x < 0) x += MOD;
    return *this;
  }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
// istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;


VV G;

Vm dfs(int k, int u, int p=-1) {
  Vm res = {1, 1, 0, 0};
  for (int v : G[u]) if (v != p) {
    auto q = dfs(k, v, u);
    q[0] *= 2;
    q[k] *= 2;
    drep(i, 4) {
      res[i] *= q[0];
      rep2(j, 1, i+1) res[i] += res[i-j] * q[j];
    }
  }
  return res;
}

int main() {
  int n; cin >> n;

  G.assign(n, V());
  rep(i, n-1) {
    int u, v; cin >> u >> v;
    --u, --v;
    G[u].push_back(v);
    G[v].push_back(u);
  }

  auto dp2 = dfs(2, 0);
  auto dp3 = dfs(3, 0);

  mint ans = mint(2).pow(n-1) * n;
  ans += dp2[2] * 6;
  ans += dp3[3] * 6;
  cout << ans << '\n';
  return 0;
}