제출 #659473

#제출 시각아이디문제언어결과실행 시간메모리
659473LoboStar Trek (CEOI20_startrek)C++17
0 / 100
10 ms12116 KiB
#include<bits/stdc++.h> using namespace std; const long long inf = (long long) 1e18 + 10; const int inf1 = (int) 1e9 + 10; #define int long long #define dbl long double #define endl '\n' #define sc second #define fr first #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() const int maxn = 5e5+10; const int mod = 1e9+7; int n, d; vector<pair<int,int>> g[maxn]; void solve() { cin >> n >> d; for(int i = 1; i <= n-1; i++) { int u,v; cin >> u >> v; int idu = g[u].size(); int idv = g[v].size(); g[u].pb(mp(v,idv)); g[v].pb(mp(u,idu)); } int ans = 1; for(int i = 1; i <= d+1; i++) { ans = ans*2%mod; } cout << ans << endl; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); // freopen("in.in", "r", stdin); // freopen("out.out", "w", stdout); int tt = 1; // cin >> tt; while(tt--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...