結果
問題 | No.1227 I hate ThREE |
ユーザー | Pachicobue |
提出日時 | 2020-09-12 00:07:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 17,119 bytes |
コンパイル時間 | 2,636 ms |
コンパイル使用メモリ | 226,140 KB |
実行使用メモリ | 385,188 KB |
最終ジャッジ日時 | 2024-06-09 04:17:03 |
合計ジャッジ時間 | 7,180 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,760 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 16 ms
8,448 KB |
testcase_04 | AC | 18 ms
9,088 KB |
testcase_05 | AC | 57 ms
24,448 KB |
testcase_06 | WA | - |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 210 ms
47,360 KB |
testcase_09 | AC | 121 ms
37,760 KB |
testcase_10 | AC | 78 ms
23,168 KB |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
ソースコード
#include <bits/stdc++.h> using ll = long long; using uint = unsigned int; using ull = unsigned long long; using ld = long double; template<typename T> using max_heap = std::priority_queue<T>; template<typename T> using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>; constexpr int popcount(const ull v) { return v ? __builtin_popcountll(v) : 0; } constexpr int log2p1(const ull v) { return v ? 64 - __builtin_clzll(v) : 0; } constexpr int lsbp1(const ull v) { return __builtin_ffsll(v); } constexpr int clog(const ull v) { return v ? log2p1(v - 1) : 0; } constexpr ull ceil2(const ull v) { return 1ULL << clog(v); } constexpr ull floor2(const ull v) { return v ? (1ULL << (log2p1(v) - 1)) : 0ULL; } constexpr bool btest(const ull mask, const int ind) { return (mask >> ind) & 1ULL; } template<typename T> void bset(T& mask, const int ind) { mask |= ((T)1 << ind); } template<typename T> void breset(T& mask, const int ind) { mask &= ~((T)1 << ind); } template<typename T> void bflip(T& mask, const int ind) { mask ^= ((T)1 << ind); } template<typename T> void bset(T& mask, const int ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); } template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); } template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); } template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4; template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884}; template<typename T> constexpr T TEN(const int n) { return n == 0 ? T{1} : TEN<T>(n - 1) * T{10}; } template<typename F> struct fix : F { fix(F&& f) : F{std::forward<F>(f)} {} template<typename... Args> auto operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); } }; template<typename T, int n, int i = 0> auto nd_array(int const (&szs)[n], const T x = T{}) { if constexpr (i == n) { return x; } else { return std::vector(szs[i], nd_array<T, n, i + 1>(szs, x)); } } class printer { public: printer(std::ostream& os_ = std::cout) : os{os_} { os << std::fixed << std::setprecision(15); } template<typename T> int operator()(const T& v) { return os << v, 0; } template<typename T> int operator()(const std::vector<T>& vs) { for (int i = 0; i < (int)vs.size(); i++) { os << (i ? " " : ""), this->operator()(vs[i]); } return 0; } template<typename T> int operator()(const std::vector<std::vector<T>>& vss) { for (int i = 0; i < (int)vss.size(); i++) { os << (0 <= i or i + 1 < (int)vss.size() ? "\n" : ""), this->operator()(vss[i]); } return 0; } template<typename T, typename... Args> int operator()(const T& v, const Args&... args) { return this->operator()(v), os << ' ', this->operator()(args...), 0; } template<typename... Args> int ln(const Args&... args) { return this->operator()(args...), os << '\n', 0; } template<typename... Args> int el(const Args&... args) { return this->operator()(args...), os << std::endl, 0; } template<typename... Args> int fmt(const std::string& s, const Args&... args) { return rec(s, 0, args...); } private: int rec(const std::string& s, int index) { return os << s.substr(index, s.size()), 0; } template<typename T, typename... Args> int rec(const std::string& s, int index, const T& v, const Args&... args) { return index == s.size() ? 0 : s[index] == '%' ? (this->operator()(v), rec(s, index + 1, args...)) : (os << s[index], rec(s, index + 1, v, args...)); } std::ostream& os; }; printer out; class scanner { public: scanner(std::istream& is_ = std::cin) : is{is_} { is.tie(nullptr), std::ios::sync_with_stdio(false); } template<typename T> T val() { T v; return is >> v, v; } template<typename T> T val(const T offset) { return val<T>() - offset; } template<typename T> std::vector<T> vec(const int n) { std::vector<T> vs(n); for (auto& v : vs) { v = val<T>(); } return vs; } template<typename T> std::vector<T> vec(const int n, const T offset) { std::vector<T> vs(n); for (auto& v : vs) { v = val<T>(offset); } return vs; } template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1) { std::vector<std::vector<T>> vss(n0); for (auto& vs : vss) { vs = vec<T>(n1); } return vss; } template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1, const T offset) { std::vector<std::vector<T>> vss(n0); for (auto& vs : vss) { vs = vec<T>(n1, offset); } return vss; } template<typename... Args> auto tup() { return std::tuple<std::decay_t<Args>...>{val<Args>()...}; } template<typename... Args> auto tup(const Args&... offsets) { return std::tuple<std::decay_t<Args>...>{val<Args>(offsets)...}; } private: std::istream& is; }; scanner in; # define SHOW(...) static_cast<void>(0) template<typename T = int> struct edge { using cost_type = T; int v; T c; edge(const int v_) : v{v_}, c{1} {} edge(const int v_, const T& c_) : v{v_}, c{c_} {} operator int() const { return v; } int to() const { return v; } T cost() const { return c; } friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << "->" << e.v << ":" << e.c; } }; template<typename Edge> class base_graph { public: base_graph(const int n) : sz{n}, es(n), res(n) {} void add_edge(const int u, const int v, const bool bi = false) { es[u].emplace_back(v); res[v].emplace_back(u); if (bi) { es[v].emplace_back(u); res[u].emplace_back(v); } } template<typename Cost> void add_edge(const int u, const int v, const Cost& c, const bool bi = false) { es[u].emplace_back(v, c); res[v].emplace_back(u, c); if (bi) { es[v].emplace_back(u, c); res[u].emplace_back(v, c); } } std::vector<Edge>& operator[](const int u) { return es[u]; } const std::vector<Edge>& operator[](const int u) const { return es[u]; } std::vector<Edge>& from(const int u) { return es[u]; } const std::vector<Edge>& from(const int u) const { return es[u]; } std::vector<Edge>& to(const int v) { return res[v]; } const std::vector<Edge>& to(const int v) const { return res[v]; } int size() const { return sz; } friend std::ostream& operator<<(std::ostream& os, const base_graph& g) { for (int i = 0; i < g.sz; i++) { for (const auto& e : g.es[i]) { os << e << '\n'; } } return os; } private: int sz; std::vector<std::vector<Edge>> es, res; }; using graph = base_graph<edge<>>; template<typename Cost> using cost_graph = base_graph<edge<Cost>>; template<typename T> constexpr std::pair<T, T> extgcd(const T a, const T b) { if (b == 0) { return std::pair<T, T>{1, 0}; } const auto g = std::gcd(a, b), da = std::abs(b) / g; const auto p = extgcd(b, a % b); const auto x = (da + p.second % da) % da, y = (g - a * x) / b; return {x, y}; } template<typename T> constexpr T inverse(const T a, const T mod) { return extgcd(a, mod).first; } template<uint mod_value, bool dynamic = false> class modint_base { public: template<typename UInt = uint> static std::enable_if_t<dynamic, const UInt> mod() { return mod_ref(); } template<typename UInt = uint> static constexpr std::enable_if_t<not dynamic, const UInt> mod() { return mod_value; } template<typename UInt = uint> static void set_mod(const std::enable_if_t<dynamic, const UInt> mod) { mod_ref() = mod, inv_ref() = {1, 1}; } modint_base() : v{0} {} modint_base(const ll val) : v{norm(static_cast<uint>(val % static_cast<ll>(mod()) + static_cast<ll>(mod())))} {} modint_base(const modint_base& n) : v{n()} {} explicit operator bool() const { return v != 0; } explicit operator int() const { return v; } explicit operator uint() const { return v; } explicit operator ll() const { return v; } explicit operator ull() const { return v; } bool operator!() const { return not static_cast<bool>(*this); } modint_base& operator=(const modint_base& m) { return v = m(), (*this); } modint_base& operator=(const ll val) { return v = norm(uint(val % static_cast<ll>(mod()) + static_cast<ll>(mod()))), (*this); } friend modint_base operator+(const modint_base& m) { return m; } friend modint_base operator-(const modint_base& m) { return make(norm(mod() - m.v)); } friend modint_base operator+(const modint_base& m1, const modint_base& m2) { return make(norm(m1.v + m2.v)); } friend modint_base operator-(const modint_base& m1, const modint_base& m2) { return make(norm(m1.v + mod() - m2.v)); } friend modint_base operator*(const modint_base& m1, const modint_base& m2) { return make(static_cast<uint>(static_cast<ll>(m1.v) * static_cast<ll>(m2.v) % static_cast<ll>(mod()))); } friend modint_base operator/(const modint_base& m1, const modint_base& m2) { return m1 * inv(m2.v); } friend modint_base operator+(const modint_base& m, const ll val) { return modint_base{static_cast<ll>(m.v) + val}; } friend modint_base operator-(const modint_base& m, const ll val) { return modint_base{static_cast<ll>(m.v) - val}; } friend modint_base operator*(const modint_base& m, const ll val) { return modint_base{static_cast<ll>(m.v) * (val % static_cast<ll>(mod()))}; } friend modint_base operator/(const modint_base& m, const ll val) { return modint_base{static_cast<ll>(m.v) * inv(val)}; } friend modint_base operator+(const ll val, const modint_base& m) { return modint_base{static_cast<ll>(m.v) + val}; } friend modint_base operator-(const ll val, const modint_base& m) { return modint_base{-static_cast<ll>(m.v) + val}; } friend modint_base operator*(const ll val, const modint_base& m) { return modint_base{static_cast<ll>(m.v) * (val % static_cast<ll>(mod()))}; } friend modint_base operator/(const ll val, const modint_base& m) { return modint_base{val * inv(static_cast<ll>(m.v))}; } friend modint_base& operator+=(modint_base& m1, const modint_base& m2) { return m1 = m1 + m2; } friend modint_base& operator-=(modint_base& m1, const modint_base& m2) { return m1 = m1 - m2; } friend modint_base& operator*=(modint_base& m1, const modint_base& m2) { return m1 = m1 * m2; } friend modint_base& operator/=(modint_base& m1, const modint_base& m2) { return m1 = m1 / m2; } friend modint_base& operator+=(modint_base& m, const ll val) { return m = m + val; } friend modint_base& operator-=(modint_base& m, const ll val) { return m = m - val; } friend modint_base& operator*=(modint_base& m, const ll val) { return m = m * val; } friend modint_base& operator/=(modint_base& m, const ll val) { return m = m / val; } friend modint_base operator^(const modint_base& m, const ll n) { return power(m.v, n); } friend modint_base& operator^=(modint_base& m, const ll n) { return m = m ^ n; } friend bool operator==(const modint_base& m1, const modint_base& m2) { return m1.v == m2.v; } friend bool operator!=(const modint_base& m1, const modint_base& m2) { return not(m1 == m2); } friend bool operator==(const modint_base& m, const ll val) { return m.v == norm(static_cast<uint>(static_cast<ll>(mod()) + val % static_cast<ll>(mod()))); } friend bool operator!=(const modint_base& m, const ll val) { return not(m == val); } friend bool operator==(const ll val, const modint_base& m) { return m.v == norm(static_cast<uint>(static_cast<ll>(mod()) + val % static_cast<ll>(mod()))); } friend bool operator!=(const ll val, const modint_base& m) { return not(m == val); } friend std::istream& operator>>(std::istream& is, modint_base& m) { ll v; return is >> v, m = v, is; } friend std::ostream& operator<<(std::ostream& os, const modint_base& m) { return os << m(); } uint operator()() const { return v; } static modint_base fact(const int n) { auto& fact_ = fact_ref(); if (n < (int)fact_.size()) { return fact_[n]; } for (int i = (int)fact_.size(); i <= n; i++) { fact_.push_back(fact_.back() * i); } return fact_.back(); } static modint_base inv_fact(const int n) { auto& inv_fact_ = inv_fact_ref(); if (n < (int)inv_fact_.size()) { return inv_fact_[n]; } for (int i = inv_fact_.size(); i <= n; i++) { inv_fact_.push_back(inv_fact_.back() * modint_base::small_inv(i)); } return inv_fact_.back(); } static modint_base perm(const int n, const int k) { return k > n ? modint_base{0} : fact(n) * inv_fact(n - k); } static modint_base comb(const int n, const int k) { return k > n ? modint_base{0} : fact(n) * inv_fact(n - k) * inv_fact(k); } std::pair<ll, ll> quad() const { const auto ans = quad_r(v, mod()); ll x = std::get<0>(ans), y = std::get<1>(ans); if (y < 0) { x = -x, y = -y; } return {x, y}; } private: static std::tuple<ll, ll, ll> quad_r(const ll r, const ll p) // r = x/y (mod p), (x,y,z) s.t. x=yr+pz { if (std::abs(r) <= 1000) { return {r, 1, 0}; } ll nr = p % r, q = p / r; if (nr * 2LL >= r) { nr -= r, q++; } if (nr * 2LL <= -r) { nr += r, q--; } const auto sub = quad_r(nr, r); const ll x = std::get<0>(sub), z = std::get<1>(sub), y = std::get<2>(sub); return {x, y - q * z, z}; } template<typename UInt = uint> static std::enable_if_t<dynamic, UInt&> mod_ref() { static UInt mod = 0; return mod; } static uint norm(const uint x) { return x < mod() ? x : x - mod(); } static modint_base make(const uint x) { modint_base m; return m.v = x, m; } static modint_base power(modint_base x, ull n) { modint_base ans = 1; for (; n; n >>= 1, x *= x) { if (n & 1) { ans *= x; } } return ans; } static modint_base small_inv(const int n) { auto& inv_ = inv_ref(); if (n < (int)inv_.size()) { return inv_[n]; } for (int i = inv_.size(); i <= n; i++) { inv_.push_back(-inv_[modint_base::mod() % i] * (modint_base::mod() / i)); } return inv_.back(); } static modint_base inv(const ll v) { return v <= 2000000 ? small_inv(static_cast<int>(v)) : modint_base{inverse(v, static_cast<ll>(mod()))}; } static std::vector<modint_base>& inv_ref() { static std::vector<modint_base> inv_{1, 1}; return inv_; } static std::vector<modint_base>& fact_ref() { static std::vector<modint_base> fact_{1, 1}; return fact_; } static std::vector<modint_base>& inv_fact_ref() { static std::vector<modint_base> inv_fact_{1, 1}; return inv_fact_; } uint v; }; template<uint mod> using modint = modint_base<mod, false>; template<uint id> using dynamic_modint = modint_base<id, true>; int main() { using mint = modint<1000000007>; const auto [N, C] = in.tup<int, ll>(); graph g(N); for (int i = 0; i < N - 1; i++) { const auto [u, v] = in.tup<int, int>(1, 1); g.add_edge(u, v, true); } const ll L = 3LL * (N - 1); const ll R = C - 1 - 3LL * (N - 1); std::vector<int> par(N, -1); std::vector<int> sub(N, 1); fix([&](auto f, const int s, const int p) -> void { for (const int to : g[s]) { if (to == p) { continue; } f(to, s); par[to] = s; sub[s] += sub[to]; } })(0, -1); std::vector<mint> ps(N + 1, 1); for (int i = 1; i <= N; i++) { ps[i] = ps[i - 1] * 2; } std::vector<std::map<ll, mint>> memo(N); auto dp = fix([&](auto f, const int s, const ll a) -> mint { if (L <= a and a <= R) { return ps[sub[s] - 1]; } if (memo[s].count(a)) { return memo[s].at(a); } mint ans = 1; for (const int to : g[s]) { if (to == par[s]) { continue; } mint sub = 0; if (a - 3 >= 0) { sub += f(to, a - 3); } if (a + 3 < C) { sub += f(to, a + 3); } ans *= sub; } return memo[s][a] = ans; }); mint ans = 0; for (ll i = 0; i < std::min(L, C); i++) { ans += dp(0, i); } for (ll i = std::max(L, R) + 1; i < C; i++) { ans += dp(0, i); } if (L <= R) { ans += (R - L + 1) * dp(0, L); } out.ln(ans); return 0; }