#361423 (C++14) No.196 典型DP (1)

提出ソース

結果

問題	No.196 典型DP (1)
ユーザー	fumiphys
提出日時	2019-07-23 21:10:48
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	24 ms / 2,000 ms
コード長	4,461 bytes
コンパイル時間	1,813 ms
コンパイル使用メモリ	172,372 KB
実行使用メモリ	34,604 KB
最終ジャッジ日時	2024-06-26 08:49:42
合計ジャッジ時間	3,425 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	3 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	4 ms 8,036 KB
testcase_16	AC	5 ms 14,200 KB
testcase_17	AC	8 ms 20,240 KB
testcase_18	AC	10 ms 26,404 KB
testcase_19	AC	11 ms 28,728 KB
testcase_20	AC	10 ms 32,952 KB
testcase_21	AC	11 ms 33,088 KB
testcase_22	AC	10 ms 33,092 KB
testcase_23	AC	13 ms 33,540 KB
testcase_24	AC	11 ms 33,392 KB
testcase_25	AC	16 ms 33,260 KB
testcase_26	AC	12 ms 34,372 KB
testcase_27	AC	13 ms 34,488 KB
testcase_28	AC	18 ms 34,344 KB
testcase_29	AC	20 ms 34,352 KB
testcase_30	AC	20 ms 34,500 KB
testcase_31	AC	9 ms 32,952 KB
testcase_32	AC	17 ms 32,956 KB
testcase_33	AC	21 ms 33,076 KB
testcase_34	AC	24 ms 32,952 KB
testcase_35	AC	24 ms 33,064 KB
testcase_36	AC	9 ms 33,072 KB
testcase_37	AC	13 ms 33,084 KB
testcase_38	AC	20 ms 34,604 KB
testcase_39	AC	21 ms 33,088 KB
testcase_40	AC	24 ms 34,472 KB
testcase_41	AC	3 ms 6,940 KB
testcase_42	AC	2 ms 6,944 KB
testcase_43	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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 vrep(v, i) for(int i = 0; i < (v).size(); i++)
#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 FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
vector<int> edge[2001], child[2001];
int size[2001];
bool vis[2001];

void dfs(int i){
  vis[i] = true;
  size[i] = 1;
  for(auto e: edge[i]){
    if(!vis[e]){
      dfs(e);
      child[i].pb(e);
      size[i] += size[e];
    }
  }
}

ll dp[2001][2001];
ll dp2[2][2001];
int k;

void calc(int i){
  for(auto c: child[i])calc(c);
  int all = min(k, size[i] - 1);
  rep(l, 2){
    rep(j, all + 1){
      dp2[l][j] = 0;
    }
  }
  dp2[0][0] = 1;
  int acc = 0;
  rep(j, sz(child[i])){
    rep(l, min(acc, k) + 1){
      rep(m, min(size[child[i][j]], k) + 1){
        if(l + m > min(k, acc + size[child[i][j]]))break;
        dp2[(j+1)&1][l+m] = (dp2[(j+1)&1][l+m] + dp[child[i][j]][m] * dp2[j&1][l] % mod) % mod;
      }
    }
    acc += size[child[i][j]];
    rep(l, min(acc, k) + 1)dp2[j&1][l] = 0;
  }
  rep(j, acc + 1){
    dp[i][j] = dp2[(sz(child[i]))&1][j];
  }
  if(size[i] <= k)dp[i][size[i]] = 1;
}


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

yukicoder

結果

テストケース

ソースコード