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

• 問題: No.1124 Earthquake Safety
• ユーザー: sigma425
• 提出日時: 2020-07-23 00:55:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 307 ms / 3,000 ms
• コード長: 4,058 bytes
• コンパイル時間: 2,432 ms
• コンパイル使用メモリ: 210,120 KB
• 実行使用メモリ: 103,868 KB
• 最終ジャッジ日時: 2024-06-23 03:39:56
• 合計ジャッジ時間: 15,844 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
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	7 ms; 5,376 KB
testcase_08	AC	80 ms; 8,832 KB
testcase_09	AC	281 ms; 19,968 KB
testcase_10	AC	227 ms; 103,868 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	287 ms; 19,928 KB
testcase_15	AC	272 ms; 19,876 KB
testcase_16	AC	293 ms; 19,944 KB
testcase_17	AC	307 ms; 19,840 KB
testcase_18	AC	303 ms; 19,932 KB
testcase_19	AC	299 ms; 20,012 KB
testcase_20	AC	299 ms; 19,840 KB
testcase_21	AC	299 ms; 19,968 KB
testcase_22	AC	303 ms; 19,840 KB
testcase_23	AC	256 ms; 19,852 KB
testcase_24	AC	271 ms; 19,840 KB
testcase_25	AC	261 ms; 20,224 KB
testcase_26	AC	266 ms; 20,096 KB
testcase_27	AC	248 ms; 24,704 KB
testcase_28	AC	258 ms; 24,696 KB
testcase_29	AC	267 ms; 39,808 KB
testcase_30	AC	262 ms; 39,800 KB
testcase_31	AC	289 ms; 71,688 KB
testcase_32	AC	291 ms; 65,664 KB
testcase_33	AC	284 ms; 63,072 KB
testcase_34	AC	283 ms; 70,240 KB
testcase_35	AC	254 ms; 19,552 KB
testcase_36	AC	240 ms; 19,584 KB
testcase_37	AC	254 ms; 20,796 KB
testcase_38	AC	246 ms; 20,608 KB
testcase_39	AC	240 ms; 20,308 KB
testcase_40	AC	243 ms; 20,992 KB
testcase_41	AC	235 ms; 20,608 KB
testcase_42	AC	236 ms; 20,992 KB
testcase_43	AC	233 ms; 21,284 KB
testcase_44	AC	230 ms; 21,248 KB
testcase_45	AC	224 ms; 20,864 KB
testcase_46	AC	218 ms; 21,240 KB
testcase_47	AC	219 ms; 20,864 KB
testcase_48	AC	218 ms; 20,936 KB
testcase_49	AC	230 ms; 20,700 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	2 ms; 5,376 KB
testcase_54	AC	2 ms; 5,376 KB
testcase_55	AC	2 ms; 5,376 KB
testcase_56	AC	2 ms; 5,376 KB
testcase_57	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll p[]={a,1,0},q[]={b,0,1};
		while(*q){
			ll t=*p/ *q;
			rep(i,3) swap(p[i]-=t*q[i],q[i]);
		}
		if(p[0]<0) rep(i,3) p[i]=-p[i];
		x=p[1],y=p[2];
		return p[0];
	}
	ModInt inv() const {
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N;
	VV<int> G(N);
	rep(i,N-1){
		int x,y; cin >> x >> y; x--,y--;
		G[x].pb(y);G[y].pb(x);
	}
	function<V<mint>(int,int)> dfs = [&](int v,int p){
		V<mint> a(8); a[0] = 1;
		for(int u: G[v]) if(u != p){
			V<mint> b = dfs(u,v);
			b[0] *= 2, b[7] *= 2;
			V<mint> na(8);
			rep(i,8) rep(j,8) if((i&j)==0) na[i|j] += a[i] * b[j];
			a = na;
		}
		V<mint> na(8);
		rep(i,8) rep(j,8) if((i&j) == j) na[i] += a[j];
		return na;
	};
	cout << dfs(0,-1)[7] << endl;
}