結果
問題 | No.1124 Earthquake Safety |
ユーザー | fuppy_kyopro |
提出日時 | 2020-07-23 18:01:48 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 528 ms / 3,000 ms |
コード長 | 4,468 bytes |
コンパイル時間 | 1,803 ms |
コンパイル使用メモリ | 174,868 KB |
実行使用メモリ | 123,508 KB |
最終ジャッジ日時 | 2023-09-05 22:28:02 |
合計ジャッジ時間 | 24,616 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
52,960 KB |
testcase_01 | AC | 42 ms
53,104 KB |
testcase_02 | AC | 43 ms
52,960 KB |
testcase_03 | AC | 42 ms
53,044 KB |
testcase_04 | AC | 42 ms
52,964 KB |
testcase_05 | AC | 42 ms
53,056 KB |
testcase_06 | AC | 43 ms
52,956 KB |
testcase_07 | AC | 51 ms
53,632 KB |
testcase_08 | AC | 167 ms
56,880 KB |
testcase_09 | AC | 463 ms
64,368 KB |
testcase_10 | AC | 402 ms
123,508 KB |
testcase_11 | AC | 43 ms
53,000 KB |
testcase_12 | AC | 43 ms
53,240 KB |
testcase_13 | AC | 42 ms
53,128 KB |
testcase_14 | AC | 485 ms
64,416 KB |
testcase_15 | AC | 477 ms
64,572 KB |
testcase_16 | AC | 472 ms
64,460 KB |
testcase_17 | AC | 479 ms
64,456 KB |
testcase_18 | AC | 487 ms
64,388 KB |
testcase_19 | AC | 484 ms
64,448 KB |
testcase_20 | AC | 486 ms
64,548 KB |
testcase_21 | AC | 481 ms
64,220 KB |
testcase_22 | AC | 482 ms
64,604 KB |
testcase_23 | AC | 456 ms
64,216 KB |
testcase_24 | AC | 456 ms
64,000 KB |
testcase_25 | AC | 455 ms
64,572 KB |
testcase_26 | AC | 449 ms
64,148 KB |
testcase_27 | AC | 460 ms
67,320 KB |
testcase_28 | AC | 455 ms
67,428 KB |
testcase_29 | AC | 483 ms
78,140 KB |
testcase_30 | AC | 483 ms
78,280 KB |
testcase_31 | AC | 520 ms
101,392 KB |
testcase_32 | AC | 512 ms
97,148 KB |
testcase_33 | AC | 523 ms
93,828 KB |
testcase_34 | AC | 528 ms
99,324 KB |
testcase_35 | AC | 455 ms
65,116 KB |
testcase_36 | AC | 437 ms
64,184 KB |
testcase_37 | AC | 444 ms
66,184 KB |
testcase_38 | AC | 432 ms
65,380 KB |
testcase_39 | AC | 423 ms
64,628 KB |
testcase_40 | AC | 424 ms
65,868 KB |
testcase_41 | AC | 415 ms
64,748 KB |
testcase_42 | AC | 411 ms
65,880 KB |
testcase_43 | AC | 417 ms
66,256 KB |
testcase_44 | AC | 419 ms
66,160 KB |
testcase_45 | AC | 414 ms
65,060 KB |
testcase_46 | AC | 413 ms
66,124 KB |
testcase_47 | AC | 414 ms
65,012 KB |
testcase_48 | AC | 401 ms
64,936 KB |
testcase_49 | AC | 417 ms
66,120 KB |
testcase_50 | AC | 43 ms
53,212 KB |
testcase_51 | AC | 42 ms
52,996 KB |
testcase_52 | AC | 44 ms
52,956 KB |
testcase_53 | AC | 42 ms
53,128 KB |
testcase_54 | AC | 42 ms
53,048 KB |
testcase_55 | AC | 43 ms
53,224 KB |
testcase_56 | AC | 42 ms
53,144 KB |
testcase_57 | AC | 42 ms
53,060 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define DEBUG(x) cerr<<#x<<": "<<x<<endl; #define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl; #define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;} typedef long long ll; #define int ll #define vi vector<int> #define vl vector<ll> #define vii vector< vector<int> > #define vll vector< vector<ll> > #define vs vector<string> #define pii pair<int,int> #define pis pair<int,string> #define psi pair<string,int> #define pll pair<ll,ll> template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); } template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); } template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(int)(n);i>0;i--) #define REP(i,a,b) for(int i=a;i<b;i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(),c.end() template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl; // int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; // int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1}; // vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 }; #define fio() cin.tie(0); ios::sync_with_stdio(false); const ll MOD = 1000000007; // const ll MOD = 998244353; // #define mp make_pair //#define endl '\n' const int MAXN = 555555; vl fact(MAXN); vl rfact(MAXN); ll mod_pow(ll x, ll p, ll M = MOD) { if (p < 0) { x = mod_pow(x, M - 2, M); p = -p; } ll a = 1; while (p) { if (p % 2) a = a*x%M; x = x*x%M; p /= 2; } return a; } ll mod_inverse(ll a, ll M = MOD) { return mod_pow(a, M - 2, M); } void set_fact(ll n, ll M = MOD) { fact[0] = 1; for (ll i = 1; i <= n; i++) { fact[i] = i * fact[i - 1] % M; } rfact[n] = mod_inverse(fact[n], M); for (ll i = n - 1; i >= 0; i--) { rfact[i] = (i + 1) * rfact[i + 1] % M; } } //http://drken1215.hatenablog.com/entry/2018/06/08/210000 //n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ��ď����Ă��� ll nCr(ll n, ll r, ll M = MOD) { if (r > n) return 0; assert(fact[2] == 2); ll ret = fact[n]; if (rfact[r] == 0) { rfact[r] = mod_inverse(fact[r], M); } ret = (ret*rfact[r]) % M; if (rfact[n - r] == 0) { rfact[n - r] = mod_inverse(fact[n - r], M); } ret = (ret*rfact[n - r]) % M; return ret; } ll nHr(ll n, ll r) { return nCr(n+r-1, r); } const int N = 312345; // const int N = 3; vii G(N); vll dp(N, vl(8)); vl sub(N); vl dfs(int now, int par) { vl res(8); sub[now] = 1; rep (i, 8) res[i] = 1; for (int v: G[now]) { if (v == par) continue; vl temp = dfs(v, now); // if (now == 0) { // DEBUG_VEC(temp); // DEBUG_VEC(res); // } vl res2(8); rep (i, 8) { rep (j, 8) { if ((i & j) != 0) continue; (res2[i | j] += res[i] * temp[j] % MOD) %= MOD; } } swap(res, res2); sub[now] += sub[v]; } dp[now] = res; (res[0] += mod_pow(2, sub[now] - 1)) %= MOD; return res; } signed main() { int n; cin >> n; rep (i, n - 1) { int u, v; cin >> u >> v; u--; v--; G[u].push_back(v); G[v].push_back(u); } dfs(0, -1); // DEBUG_MAT(dp); ll ans = 0; rep (i, n) { ll c = 1; if (i != 0) c = mod_pow(2, n - sub[i] - 1); ans += dp[i][7] * c % MOD; ans %= MOD; } ans %= MOD; cout << ans << endl; }