結果

問題 No.1227 I hate ThREE
ユーザー masayoshi361masayoshi361
提出日時 2020-09-11 23:50:35
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 246 ms / 2,000 ms
コード長 6,283 bytes
コンパイル時間 3,093 ms
コンパイル使用メモリ 204,412 KB
実行使用メモリ 42,480 KB
最終ジャッジ日時 2023-08-30 14:50:52
合計ジャッジ時間 8,472 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 32 ms
41,496 KB
testcase_04 AC 33 ms
41,936 KB
testcase_05 AC 44 ms
40,348 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 75 ms
16,600 KB
testcase_09 AC 66 ms
15,032 KB
testcase_10 AC 50 ms
12,108 KB
testcase_11 AC 233 ms
40,360 KB
testcase_12 AC 246 ms
42,420 KB
testcase_13 AC 17 ms
7,304 KB
testcase_14 AC 42 ms
14,420 KB
testcase_15 AC 56 ms
18,192 KB
testcase_16 AC 95 ms
26,888 KB
testcase_17 AC 69 ms
21,088 KB
testcase_18 AC 114 ms
31,532 KB
testcase_19 AC 100 ms
27,956 KB
testcase_20 AC 122 ms
32,856 KB
testcase_21 AC 10 ms
5,444 KB
testcase_22 AC 103 ms
28,480 KB
testcase_23 AC 223 ms
41,676 KB
testcase_24 AC 205 ms
42,480 KB
testcase_25 AC 231 ms
42,336 KB
testcase_26 AC 163 ms
40,368 KB
testcase_27 AC 170 ms
41,568 KB
testcase_28 AC 175 ms
42,136 KB
testcase_29 AC 181 ms
42,104 KB
testcase_30 AC 164 ms
40,880 KB
testcase_31 AC 164 ms
40,816 KB
testcase_32 AC 170 ms
41,824 KB
testcase_33 AC 165 ms
40,884 KB
testcase_34 AC 165 ms
41,300 KB
testcase_35 AC 164 ms
40,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region header */
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template <typename T>
using mat = vector<vector<T>>;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;

template <int mod>
struct modint {
    int x;

    modint() : x(0) {}

    modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    modint &operator+=(const modint &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator-=(const modint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator*=(const modint &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    modint &operator/=(const modint &p) {
        *this *= p.inverse();
        return *this;
    }

    modint operator-() const { return modint(-x); }

    modint operator+(const modint &p) const { return modint(*this) += p; }

    modint operator-(const modint &p) const { return modint(*this) -= p; }

    modint operator*(const modint &p) const { return modint(*this) *= p; }

    modint operator/(const modint &p) const { return modint(*this) /= p; }

    bool operator==(const modint &p) const { return x == p.x; }

    bool operator!=(const modint &p) const { return x != p.x; }

    modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return modint(u);
    }

    modint pow(int64_t n) const {
        modint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const modint &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, modint &a) {
        int64_t t;
        is >> t;
        a = modint<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};
// abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (ll i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) \
    for (ll i = (b - 1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vprint(x)                         \
    rep(i, x.size()) cout << x[i] << ' '; \
    cout << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
// functions
// gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
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 (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
T mypow(T x, ll n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}
ll modpow(ll x, ll n, const ll mod) {
    ll ret = 1;
    while (n > 0) {
        if (n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
        x %= mod;
        ret %= mod;
    }
    return ret;
}
template <typename T>
uint64_t my_rand(void) {
    static uint64_t x = 88172645463325252ULL;
    x = x ^ (x << 13);
    x = x ^ (x >> 7);
    return x = x ^ (x << 17);
}
int popcnt(ull x) { return __builtin_popcountll(x); }
// graph template
template <typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}

    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    bool operator<(const edge<T> &r) const { return cost < r.cost; }

    operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
struct Timer {
    clock_t start_time;
    void start() { start_time = clock(); }
    int lap() {
        // return x ms.
        return (clock() - start_time) * 1000 / CLOCKS_PER_SEC;
    }
};
/* #endregion*/
// constant
#define inf 1000000005
#define INF 8000000004000000000LL
#define mod 1000000007LL
//#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.000000000000001;
const long double PI = 3.141592653589793;
// library
const int mx = 5000;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(30);
    ll n, c;
    cin >> n >> c;
    c++;
    ll m = min(c, (ll)mx);
    mat<int> g(n);
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].pb(b);
        g[b].pb(a);
    }
    mat<int> memo(n, vector<int>(mx * 2 + 5, -1));
    auto dp = [&](int v, int par, int p, auto dp) {
        if (p < 1 || p >= c) return (mint)0;
        if (memo[v][p] >= 0) return (mint)memo[v][p];
        mint res = 1;
        for (int nv : g[v]) {
            if (nv == par) continue;
            mint tmp = 0;
            tmp = dp(nv, v, p + 3, dp) + dp(nv, v, p - 3, dp);
            res *= tmp;
        }
        memo[v][p] = res.x;
        return res;
    };
    mint ans = 0;
    rep(i, m) { ans += dp(0, -1, i, dp); }
    rep(i, max(c - m, m), c) { ans += dp(0, -1, c - i, dp); }
    ans += dp(0, -1, mx, dp) * (max(c - mx, m) - m);
    print(ans);
}
0