結果

問題 No.196 典型DP (1)
ユーザー fumiphysfumiphys
提出日時 2019-09-29 23:33:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 23 ms / 2,000 ms
コード長 3,765 bytes
コンパイル時間 1,618 ms
コンパイル使用メモリ 172,864 KB
実行使用メモリ 26,752 KB
最終ジャッジ日時 2024-10-03 04:43:45
合計ジャッジ時間 3,198 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 3 ms
5,248 KB
testcase_16 AC 5 ms
6,400 KB
testcase_17 AC 7 ms
7,936 KB
testcase_18 AC 9 ms
9,856 KB
testcase_19 AC 12 ms
10,368 KB
testcase_20 AC 14 ms
11,904 KB
testcase_21 AC 15 ms
11,904 KB
testcase_22 AC 14 ms
12,032 KB
testcase_23 AC 17 ms
17,536 KB
testcase_24 AC 17 ms
15,744 KB
testcase_25 AC 17 ms
15,232 KB
testcase_26 AC 19 ms
26,752 KB
testcase_27 AC 20 ms
26,624 KB
testcase_28 AC 20 ms
26,752 KB
testcase_29 AC 19 ms
26,752 KB
testcase_30 AC 19 ms
26,752 KB
testcase_31 AC 22 ms
11,776 KB
testcase_32 AC 21 ms
11,648 KB
testcase_33 AC 23 ms
11,648 KB
testcase_34 AC 21 ms
11,648 KB
testcase_35 AC 21 ms
11,648 KB
testcase_36 AC 21 ms
11,776 KB
testcase_37 AC 14 ms
11,648 KB
testcase_38 AC 21 ms
11,648 KB
testcase_39 AC 20 ms
11,776 KB
testcase_40 AC 21 ms
11,776 KB
testcase_41 AC 2 ms
5,248 KB
testcase_42 AC 2 ms
5,248 KB
testcase_43 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

vector<int> edge[2010], child[2010];
int s[2010];
void dfs(int i){
  s[i] = 1;
  for(auto e: edge[i]){
    if(s[e] == 0){
      dfs(e);
      s[i] += s[e];
      child[i].pb(e);
    }
  }
}

ll dp[2010][2010];
void calc(int i){
  for(auto e: child[i])calc(e);
  vector<ll> pre(s[i] + 1, 0), nex(s[i] + 1, 0);
  pre[0] = 1;
  int acc = 0;
  for(auto e: child[i]){
    for(int j = 0; j <= acc + s[e]; j++)nex[j] = 0;
    for(int j = 0; j <= acc; j++){
      for(int k = 0; k <= s[e]; k++){
        (nex[j+k] += pre[j] * dp[e][k] % mod) %= mod;
      }
    }
    acc += s[e];
    swap(pre, nex);
  }
  pre[s[i]] = (pre[s[i]] + 1) % mod;
  rep(k, sz(pre))dp[i][k] = pre[k];
}

int main(int argc, char const* argv[])
{
  int n, k; cin >> n >> k;
  rep(i, n - 1){
    int a, b; cin >> a >> b;
    edge[a].pb(b);
    edge[b].pb(a);
  }
  dfs(0);
  calc(0);
  cout << dp[0][k] << endl;
  return 0;
}
0