結果

問題 No.196 典型DP (1)
ユーザー PachicobuePachicobue
提出日時 2017-08-09 18:55:26
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,456 bytes
コンパイル時間 1,675 ms
コンパイル使用メモリ 178,516 KB
実行使用メモリ 97,792 KB
最終ジャッジ日時 2024-10-12 04:00:35
合計ジャッジ時間 7,270 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
13,636 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 1 ms
6,816 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 AC 2 ms
6,820 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 3 ms
6,816 KB
testcase_14 AC 3 ms
6,816 KB
testcase_15 AC 5 ms
6,820 KB
testcase_16 AC 17 ms
6,820 KB
testcase_17 AC 25 ms
6,820 KB
testcase_18 AC 58 ms
6,820 KB
testcase_19 AC 80 ms
6,816 KB
testcase_20 AC 39 ms
6,820 KB
testcase_21 AC 79 ms
6,820 KB
testcase_22 AC 50 ms
6,816 KB
testcase_23 AC 301 ms
44,416 KB
testcase_24 AC 242 ms
29,568 KB
testcase_25 AC 259 ms
28,032 KB
testcase_26 AC 86 ms
97,792 KB
testcase_27 AC 87 ms
97,664 KB
testcase_28 AC 86 ms
97,792 KB
testcase_29 AC 87 ms
97,792 KB
testcase_30 AC 88 ms
97,792 KB
testcase_31 TLE -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// {{{ Templates
#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

// }}}

constexpr int MAX = 2000;
int N;
int K;

struct Graph {
    Graph(const int n)
    {
        edge.resize(n);
    }
    void addEdge(const int from, const int to)
    {
        edge[from].push_back(to);
    }
    vector<vector<int>> edge;
};

struct Polynomial {
    //    Polynomial() : coeff(N + 1, 0), degree(0) {}
    Polynomial() : degree(0)
    {
        fill(coeff, coeff + MAX + 1, 0);
    }

    static Polynomial monomial(const ll coe, const int deg)
    {
        Polynomial p;
        p.coeff[deg] = coe;
        p.degree = deg;
        return p;
    }

    Polynomial operator+(const Polynomial& p) const
    {
        Polynomial P;
        if (degree >= p.degree) {
            for (int i = 0; i <= p.degree; i++) {
                P.coeff[i] = (coeff[i] + p.coeff[i]) % MOD;
            }
        } else {
            for (int i = 0; i <= degree; i++) {
                P.coeff[i] = (coeff[i] + p.coeff[i]) % MOD;
            }
            for (int i = degree + 1; i <= p.degree; i++) {
                P.coeff[i] = p.coeff[i];
            }
        }
        P.degree = max(degree, p.degree);
        return (*this);
    }

    Polynomial& operator+=(const Polynomial& p)
    {
        if (degree >= p.degree) {
            for (int i = 0; i <= p.degree; i++) {
                coeff[i] += p.coeff[i];
                coeff[i] = coeff[i] % MOD;
            }
        } else {
            for (int i = 0; i <= degree; i++) {
                coeff[i] += p.coeff[i];
                coeff[i] = coeff[i] % MOD;
            }
            for (int i = degree + 1; i <= p.degree; i++) {
                coeff[i] = p.coeff[i];
                coeff[i] = coeff[i] % MOD;
            }
        }
        degree = max(degree, p.degree);
        return (*this);
    }

    Polynomial operator*(const Polynomial& p) const
    {
        Polynomial P;
        P.degree = degree + p.degree;
        for (int i = 0; i <= P.degree; i++) {
            ll sum = 0;
            for (int j = 0; j <= min(degree, i); j++) {
                sum = (sum + coeff[j] * p.coeff[i - j] % MOD) % MOD;
            }
            P.coeff[i] = sum;
        }
        return P;
    }

    int degree = 0;
    //    vector<ll> coeff;
    ll coeff[MAX + 1];
};

ostream& operator<<(ostream& os, const Polynomial& p)
{
    for (int i = 0; i <= p.degree; i++) {
        if (i > 0) {
            os << " + ";
        }
        os << p.coeff[i];
        if (i > 0) {
            os << "x^" << i;
        }
    }
    os << endl;
    return os;
}

void direct_dfs(const Graph& g_, Graph& g, const int s, vector<bool>& visited)
{
    visited[s] = true;
    for (const int to : g_.edge[s]) {
        if (not visited[to]) {
            visited[to] = true;
            g.addEdge(s, to);
            direct_dfs(g_, g, to, visited);
        }
    }
}

int size_dfs(const Graph& g, const int s, vector<int>& size)
{
    int num = 1;
    for (const int to : g.edge[s]) {
        num += size_dfs(g, to, size);
    }
    size[s] = num;
    return num;
}

Polynomial dp_dfs(const Graph& g, const int s, const vector<int>& size)
{

    Polynomial P = Polynomial::monomial(1LL, size[s]);
    Polynomial Product = Polynomial::monomial(1LL, 0);
    for (const int to : g.edge[s]) {
        Product = Product * dp_dfs(g, to, size);
    }
    P += Product;
    return P;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N >> K;
    Graph g_(N);
    for (int i = 0; i < N - 1; i++) {
        int a, b;
        cin >> a >> b;
        g_.addEdge(a, b);
        g_.addEdge(b, a);
    }
    Graph g(N);
    vector<bool> visited(N, false);
    direct_dfs(g_, g, 0, visited);

    vector<int> size(N, 0);
    size_dfs(g, 0, size);

    cout << dp_dfs(g, 0, size).coeff[K] << endl;

    return 0;
}
0