結果
問題 | No.196 典型DP (1) |
ユーザー | Haar |
提出日時 | 2019-08-07 04:34:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 47 ms / 2,000 ms |
コード長 | 3,326 bytes |
コンパイル時間 | 2,119 ms |
コンパイル使用メモリ | 205,884 KB |
実行使用メモリ | 79,356 KB |
最終ジャッジ日時 | 2023-09-25 22:31:10 |
合計ジャッジ時間 | 6,411 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
79,056 KB |
testcase_01 | AC | 23 ms
79,212 KB |
testcase_02 | AC | 23 ms
79,072 KB |
testcase_03 | AC | 23 ms
79,024 KB |
testcase_04 | AC | 23 ms
79,044 KB |
testcase_05 | AC | 23 ms
79,032 KB |
testcase_06 | AC | 23 ms
79,184 KB |
testcase_07 | AC | 23 ms
79,032 KB |
testcase_08 | AC | 23 ms
79,228 KB |
testcase_09 | AC | 23 ms
79,100 KB |
testcase_10 | AC | 23 ms
79,100 KB |
testcase_11 | AC | 23 ms
79,088 KB |
testcase_12 | AC | 23 ms
79,104 KB |
testcase_13 | AC | 23 ms
79,036 KB |
testcase_14 | AC | 23 ms
79,032 KB |
testcase_15 | AC | 25 ms
79,156 KB |
testcase_16 | AC | 25 ms
79,088 KB |
testcase_17 | AC | 28 ms
79,204 KB |
testcase_18 | AC | 32 ms
79,132 KB |
testcase_19 | AC | 32 ms
79,336 KB |
testcase_20 | AC | 34 ms
79,224 KB |
testcase_21 | AC | 34 ms
79,168 KB |
testcase_22 | AC | 33 ms
79,236 KB |
testcase_23 | AC | 36 ms
79,356 KB |
testcase_24 | AC | 34 ms
79,208 KB |
testcase_25 | AC | 38 ms
79,208 KB |
testcase_26 | AC | 34 ms
79,324 KB |
testcase_27 | AC | 34 ms
79,336 KB |
testcase_28 | AC | 38 ms
79,332 KB |
testcase_29 | AC | 41 ms
79,324 KB |
testcase_30 | AC | 43 ms
79,320 KB |
testcase_31 | AC | 41 ms
79,156 KB |
testcase_32 | AC | 43 ms
79,192 KB |
testcase_33 | AC | 44 ms
79,192 KB |
testcase_34 | AC | 46 ms
79,164 KB |
testcase_35 | AC | 47 ms
79,208 KB |
testcase_36 | AC | 40 ms
79,168 KB |
testcase_37 | AC | 36 ms
79,164 KB |
testcase_38 | AC | 44 ms
79,160 KB |
testcase_39 | AC | 43 ms
79,168 KB |
testcase_40 | AC | 47 ms
79,180 KB |
testcase_41 | AC | 23 ms
79,156 KB |
testcase_42 | AC | 23 ms
79,264 KB |
testcase_43 | AC | 23 ms
79,072 KB |
ソースコード
#include <bits/stdc++.h> #define LLI long long int #define FOR(v, a, b) for(LLI v = (a); v < (b); ++v) #define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(LLI v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define popcount __builtin_popcount #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include <misc/C++/Debug.cpp> #else #define dump(...) ((void)0) #endif #define gcd __gcd using namespace std; template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;} template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;} template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);} template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} template <typename Cost = int> class Edge{ public: int from,to; Cost cost; Edge() {} Edge(int to, Cost cost): to(to), cost(cost){} Edge(int from, int to, Cost cost): from(from), to(to), cost(cost){} Edge rev() const {return Edge(to,from,cost);} friend ostream& operator<<(ostream &os, const Edge &e){ os << "(FROM: " << e.from << "," << "TO: " << e.to << "," << "COST: " << e.cost << ")"; return os; } }; template <typename T> using Graph = vector<vector<Edge<T>>>; template <typename T> using Tree = vector<vector<Edge<T>>>; template <typename C, typename T> void add_edge(C &g, int from, int to, T w){ g[from].push_back(Edge<T>(from, to, w)); } template <typename C, typename T> void add_undirected(C &g, int a, int b, T w){ g[a].push_back(Edge<T>(a, b, w)); g[b].push_back(Edge<T>(b, a, w)); } const LLI mod = 1e9+7; LLI dp[2200][2200][2]; LLI dp2[2200][2]; int subtree[2200]; Tree<int> tree; int n,k; void rec(int cur, int par){ subtree[cur] = 1; for(auto &e : tree[cur]){ if(e.to == par) continue; rec(e.to, cur); subtree[cur] += subtree[e.to]; } fill_array(dp2, 0); dp[cur][0][0] = 1; dp[cur][subtree[cur]][1] = 1; int s = 0; for(auto &e : tree[cur]){ if(e.to == par) continue; FORE(i,0,s){ FORE(j,0,subtree[e.to]){ (dp2[i+j][0] += dp[cur][i][0] * (dp[e.to][j][0]+dp[e.to][j][1]) % mod) %= mod; } } s += subtree[e.to]; FORE(i,0,k){ dp[cur][i][0] = dp2[i][0]; dp2[i][0] = 0; } } } int main(){ cin.tie(0); ios::sync_with_stdio(false); while(cin >> n >> k){ tree = Tree<int>(n); REP(i,n-1){ int u,v; cin >> u >> v; add_undirected(tree,u,v,1); } fill_array(dp, 0); fill_array(subtree, 0); rec(0,-1); LLI ans = (dp[0][k][0] + dp[0][k][1]) % mod; cout << ans << endl; } return 0; }