結果

問題 No.1227 I hate ThREE
ユーザー iiljjiiljj
提出日時 2020-09-16 22:23:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 9,886 bytes
コンパイル時間 2,640 ms
コンパイル使用メモリ 218,112 KB
実行使用メモリ 50,560 KB
最終ジャッジ日時 2024-06-22 03:40:14
合計ジャッジ時間 5,101 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 3 ms
6,940 KB
testcase_04 AC 3 ms
6,944 KB
testcase_05 AC 7 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 11 ms
8,832 KB
testcase_09 AC 9 ms
7,680 KB
testcase_10 AC 6 ms
6,940 KB
testcase_11 AC 66 ms
45,952 KB
testcase_12 AC 74 ms
50,432 KB
testcase_13 AC 3 ms
6,940 KB
testcase_14 AC 8 ms
7,424 KB
testcase_15 AC 13 ms
10,240 KB
testcase_16 AC 28 ms
20,352 KB
testcase_17 AC 18 ms
13,056 KB
testcase_18 AC 40 ms
28,288 KB
testcase_19 AC 31 ms
22,272 KB
testcase_20 AC 44 ms
30,592 KB
testcase_21 AC 2 ms
6,944 KB
testcase_22 AC 31 ms
23,168 KB
testcase_23 AC 70 ms
48,768 KB
testcase_24 AC 76 ms
50,432 KB
testcase_25 AC 73 ms
50,560 KB
testcase_26 AC 68 ms
45,952 KB
testcase_27 AC 70 ms
48,768 KB
testcase_28 AC 73 ms
50,048 KB
testcase_29 AC 74 ms
49,920 KB
testcase_30 AC 68 ms
47,104 KB
testcase_31 AC 68 ms
46,976 KB
testcase_32 AC 72 ms
49,664 KB
testcase_33 AC 68 ms
46,720 KB
testcase_34 AC 71 ms
48,256 KB
testcase_35 AC 66 ms
46,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

/* #region mint */

// 自動で MOD を取る整数
struct mint {
    ll x;
    mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
    mint &operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator-=(const mint a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }
    // O(log(t))
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1); // ⌊t/2⌋ 乗
        a *= a;               // ⌊t/2⌋*2 乗
        if (t & 1)            // ⌊t/2⌋*2 == t-1 のとき
            a *= *this;       // ⌊t/2⌋*2+1 乗 => t 乗
        return a;
    }

    // for prime mod
    mint inv() const {
        return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
    }
    mint &operator/=(const mint a) { return (*this) *= a.inv(); }
    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
    bool operator==(const mint a) const { return this->x == a.x; }
    bool operator==(const ll a) const { return this->x == a; }

    // mint 入力
    friend istream &operator>>(istream &is, mint &x) {
        is >> x.x;
        return is;
    }

    // mint 出力
    friend ostream &operator<<(ostream &os, mint x) {
        os << x.x;
        return os;
    }
};

/* #endregion */

/* #region TreeDP */

template <typename T> struct TreeDP {
    using merge_t = function<T(T, T)>;
    using add_root_t = function<T(T)>;
    struct edge_t {
        int to;
        ll cost;
        edge_t(int to, ll cost = 0) : to(to), cost(cost) {}
    };
    using graph_t = vc<vc<edge_t>>;

    merge_t merge;
    add_root_t add_root;
    int n;     //木の要素数
    const T e; //単位元
    vector<T> dp;
    graph_t G;

    TreeDP(merge_t merge, add_root_t add_root, int n, T e) : merge(merge), add_root(add_root), n(n), e(e) {
        dp.resize(n), G.resize(n);
    }

    void add_edge(int a, int b) { G[a].emplace_back(b); }

    void build() { dfs(0); }

    void dfs(int v, int p = -1) {
        T dp_cum = e;
        int deg = (int)G[v].size();
        for (int i = 0; i < deg; ++i) {
            int x = G[v][i].to;
            if (x == p) continue;
            dfs(x, v);
            dp_cum = merge(dp_cum, dp[x]);
        }
        dp[v] = add_root(dp_cum);
    }
};

/* #endregion */

// Problem
void solve() {
    ll n, c;
    cin >> n, c;

    ll dif = 0;
    if (c > 6 * n) {
        dif = c - 6 * n;
        c = 6 * n;
    }
    using data = vc<mint>;
    data ti(c, 1); // 単位元

    auto merge = [&](data dp_cum, data d) -> data {
        REP(i, 0, c) {
            mint pat = 0;
            if (i - 3 >= 0) pat += d[i - 3];
            if (i + 3 < c) pat += d[i + 3];
            dp_cum[i] *= pat;
        }
        return dp_cum;
    };
    auto add_root = [](data d) -> data { return d; };
    TreeDP<data> tdp(merge, add_root, n, ti);

    REP(i, 0, n - 1) {
        ll a, b;
        cin >> a, b;
        --a, --b;
        tdp.add_edge(a, b);
        tdp.add_edge(b, a);
    }
    tdp.build();

    // dump(tdp.dp[0]);
    mint ans = accumulate(ALL(tdp.dp[0]), mint(0));
    if (dif > 0) ans += tdp.dp[0][3 * n] * dif;
    cout << ans << endl;
}

// entry point
int main() {
    solve();
    return 0;
}
0