結果
問題 | No.1124 Earthquake Safety |
ユーザー | tokusakurai |
提出日時 | 2022-08-03 19:23:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 282 ms / 3,000 ms |
コード長 | 6,463 bytes |
コンパイル時間 | 3,694 ms |
コンパイル使用メモリ | 206,504 KB |
実行使用メモリ | 69,832 KB |
最終ジャッジ日時 | 2023-10-11 14:16:35 |
合計ジャッジ時間 | 19,944 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,352 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,356 KB |
testcase_03 | AC | 1 ms
4,352 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,352 KB |
testcase_06 | AC | 2 ms
4,352 KB |
testcase_07 | AC | 5 ms
4,348 KB |
testcase_08 | AC | 59 ms
10,436 KB |
testcase_09 | AC | 237 ms
24,976 KB |
testcase_10 | AC | 148 ms
69,832 KB |
testcase_11 | AC | 2 ms
4,352 KB |
testcase_12 | AC | 2 ms
4,348 KB |
testcase_13 | AC | 2 ms
4,348 KB |
testcase_14 | AC | 274 ms
24,772 KB |
testcase_15 | AC | 278 ms
24,892 KB |
testcase_16 | AC | 277 ms
24,792 KB |
testcase_17 | AC | 273 ms
24,744 KB |
testcase_18 | AC | 275 ms
24,764 KB |
testcase_19 | AC | 279 ms
25,008 KB |
testcase_20 | AC | 282 ms
24,864 KB |
testcase_21 | AC | 279 ms
24,684 KB |
testcase_22 | AC | 276 ms
24,760 KB |
testcase_23 | AC | 244 ms
24,592 KB |
testcase_24 | AC | 244 ms
24,468 KB |
testcase_25 | AC | 234 ms
24,612 KB |
testcase_26 | AC | 235 ms
24,472 KB |
testcase_27 | AC | 233 ms
27,264 KB |
testcase_28 | AC | 229 ms
27,168 KB |
testcase_29 | AC | 237 ms
35,352 KB |
testcase_30 | AC | 241 ms
35,300 KB |
testcase_31 | AC | 262 ms
53,004 KB |
testcase_32 | AC | 256 ms
49,672 KB |
testcase_33 | AC | 245 ms
47,184 KB |
testcase_34 | AC | 245 ms
51,140 KB |
testcase_35 | AC | 237 ms
25,284 KB |
testcase_36 | AC | 220 ms
24,468 KB |
testcase_37 | AC | 225 ms
26,340 KB |
testcase_38 | AC | 219 ms
25,744 KB |
testcase_39 | AC | 210 ms
24,952 KB |
testcase_40 | AC | 210 ms
26,272 KB |
testcase_41 | AC | 204 ms
25,076 KB |
testcase_42 | AC | 201 ms
25,760 KB |
testcase_43 | AC | 201 ms
26,276 KB |
testcase_44 | AC | 199 ms
26,412 KB |
testcase_45 | AC | 196 ms
25,588 KB |
testcase_46 | AC | 190 ms
26,080 KB |
testcase_47 | AC | 187 ms
25,524 KB |
testcase_48 | AC | 186 ms
25,488 KB |
testcase_49 | AC | 196 ms
27,564 KB |
testcase_50 | AC | 1 ms
4,348 KB |
testcase_51 | AC | 2 ms
4,352 KB |
testcase_52 | AC | 1 ms
4,352 KB |
testcase_53 | AC | 1 ms
4,348 KB |
testcase_54 | AC | 2 ms
4,348 KB |
testcase_55 | AC | 2 ms
4,348 KB |
testcase_56 | AC | 1 ms
4,348 KB |
testcase_57 | AC | 1 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 1000000007; // const int MOD = 998244353; template <int mod> struct Mod_Int { int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} static int get_mod() { return mod; } Mod_Int &operator+=(const Mod_Int &p) { if ((x += p.x) >= mod) x -= mod; return *this; } Mod_Int &operator-=(const Mod_Int &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int &operator*=(const Mod_Int &p) { x = (int)(1LL * x * p.x % mod); return *this; } Mod_Int &operator/=(const Mod_Int &p) { *this *= p.inverse(); return *this; } Mod_Int &operator++() { return *this += Mod_Int(1); } Mod_Int operator++(int) { Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator--() { return *this -= Mod_Int(1); } Mod_Int operator--(int) { Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator-() const { return Mod_Int(-x); } Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; } Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; } Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; } Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; } bool operator==(const Mod_Int &p) const { return x == p.x; } bool operator!=(const Mod_Int &p) const { return x != p.x; } Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod - 2); } Mod_Int pow(long long k) const { Mod_Int now = *this, ret = 1; for (; k > 0; k >>= 1, now *= now) { if (k & 1) ret *= now; } return ret; } friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; } friend istream &operator>>(istream &is, Mod_Int &p) { long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; mint tw = mint(2).inverse(); template <bool directed = false> struct Graph { struct edge { int to, id; edge(int to, int id) : to(to), id(id) {} }; vector<vector<edge>> es; const int n; int m; vector<mint> dp1, dp2, dp3; mint a1 = 0, a2 = 0, a3 = 0; Graph(int n) : es(n), n(n), m(0), dp1(n, 0), dp2(n, 0), dp3(n, 0) {} void add_edge(int from, int to) { es[from].emplace_back(to, m); if (!directed) es[to].emplace_back(from, m); m++; } void dfs(int now, int pre = -1) { mint t1 = 0, t2 = 0, t3 = 0; mint s1 = 0, s2 = 0; vector<mint> dp(4, 0); dp[0] = 1; each(e, es[now]) { if (e.to == pre) continue; dfs(e.to, now); dp1[now] += dp1[e.to]; dp2[now] += dp2[e.to]; dp3[now] += dp3[e.to]; rep3(i, 2, 0) dp[i + 1] += dp[i] * dp1[e.to]; t3 += dp2[e.to]; t3 -= dp1[e.to] * dp2[e.to]; s1 += dp1[e.to]; s2 += dp2[e.to]; } t1 += 1; t2 += dp[2] + s1; t3 += dp[2] + dp[3] + s1 * s2; a1 += t1, a2 += t2, a3 += t3; // cout << t1 << ' ' << t2 << ' ' << t3 << '\n'; dp1[now] += t1, dp2[now] += t2, dp3[now] += t3; dp1[now] *= tw, dp2[now] *= tw, dp3[now] *= tw; } void solve() { dfs(0); // print(dp1), print(dp2), print(dp3); mint ans = a1 + a2 * 6 + a3 * 6; ans *= mint(2).pow(n - 1); cout << ans << '\n'; } }; int main() { int N; cin >> N; Graph G(N); rep(i, N - 1) { int u, v; cin >> u >> v; u--, v--; G.add_edge(u, v); } G.solve(); }