結果

問題 No.196 典型DP (1)
コンテスト
ユーザー ゆにぽけ
提出日時 2023-10-02 22:43:46
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 38 ms / 2,000 ms
コード長 3,778 bytes
コンパイル時間 905 ms
コンパイル使用メモリ 114,216 KB
最終ジャッジ日時 2025-02-17 04:03:01
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
#include<random>
using namespace std;
template<long long MOD>struct Modint
{
    private:
    unsigned int value;

    public:
    constexpr Modint(const long long x = 0) noexcept
    {
	long long y = x;
	if(y < 0 || y >= MOD)
	{
		y %= MOD;
		if(y < 0) y += MOD;
	}
        value = (unsigned int)y;
    }

    constexpr unsigned int &val() noexcept {return value;}

    constexpr Modint operator+(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp += other;
    }

    constexpr Modint operator-(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp -= other;
    }

    constexpr Modint operator*(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp *= other;
    }

    constexpr Modint operator/(const Modint &other) noexcept
    {
        Modint tmp = *this;
        return tmp /= other;
    }

    constexpr Modint &operator+=(const Modint &other) noexcept
    {
        value += other.value;
        if(value >= MOD) value -= MOD;

        return *this;
    }

    constexpr Modint &operator-=(const Modint &other) noexcept
    {
        unsigned long long  x = value;
        if(x < other.value) x += MOD;
        x -= other.value;

        value = (unsigned int) x;

        return *this;
    }

    constexpr Modint &operator*=(const Modint &other) noexcept
    {
        unsigned long long x = value;
        x *= other.value;
        value = (unsigned int)(x%MOD);

        return *this;
    }

    constexpr Modint &operator/=(const Modint &other) noexcept
    {
        return *this = *this * other.inverse();
    }

    constexpr Modint power(long long ex) const noexcept
    {
        assert(ex >= 0);
        Modint p = *this,res = 1;

        while(ex)
        {
            if(ex & 1) res *= p;
            p *= p;
            ex >>= 1;
        }

        return res;
    }

    constexpr Modint inverse() const noexcept
    {
        assert(value);
        long long a = value,b = MOD,x = 1,y = 0;

        while(b)
        {
            long long q = a/b;

            a -= q*b; swap(a,b);
            x -= q*y; swap(x,y);
        }

        return Modint(x);
    }

    constexpr Modint &operator++(int) noexcept {return *this += 1;}

    constexpr Modint &operator--(int) noexcept {return *this -= 1;}

    constexpr bool operator==(const Modint &other){return value == other.value;}

    constexpr bool operator!=(const Modint &other){return value != other.value;}

    template<long long mod> friend ostream &operator<<(ostream &os,const Modint<mod> &x);
};

template<long long mod> ostream &operator<<(ostream &os,const Modint<mod> &x){os << x.value; return os;}

//using mint = Modint<998244353>;
using mint = Modint<1000000007>;
int N,K,ch[2000];
vector<int> G[2000];
mint dp[2000][2001];
void dfs(int u,int p)
{
	ch[u] = 1;
	mint ep[2][2001];
	int now = 0;
	for(int i = 0;i <= N;i++) ep[now][i] = 0;
	ep[now][0] = 1;
	for(int v:G[u]) if(v != p)
	{
		dfs(v,u);
		int nxt = 1-now;
		for(int i = 0;i <= ch[u]+ch[v];i++) ep[nxt][i] = 0;
		for(int i = 0;i < ch[u];i++)for(int j = 0;j <= ch[v];j++) ep[nxt][i+j] += ep[now][i]*dp[v][j];
		now = nxt;
		ch[u] += ch[v];
	}
	for(int i = 0;i <= N;i++) dp[u][i] = ep[now][i];
	dp[u][ch[u]] = 1;
}
void solve()
{
	cin >> N >> K;
	for(int i = 1;i < N;i++)
	{
		int u,v;
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}

	dfs(0,-1);

	cout << dp[0][K] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T = 1;
	//cin >> T;
	while(T--) solve();
}
0