結果
問題 | No.1227 I hate ThREE |
ユーザー | KoD |
提出日時 | 2020-09-12 00:25:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 7,677 bytes |
コンパイル時間 | 890 ms |
コンパイル使用メモリ | 86,820 KB |
実行使用メモリ | 26,536 KB |
最終ジャッジ日時 | 2023-08-30 14:52:06 |
合計ジャッジ時間 | 3,073 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 3 ms
4,376 KB |
testcase_04 | AC | 3 ms
4,376 KB |
testcase_05 | AC | 5 ms
4,720 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 6 ms
5,896 KB |
testcase_09 | AC | 5 ms
5,256 KB |
testcase_10 | AC | 4 ms
4,516 KB |
testcase_11 | AC | 38 ms
24,380 KB |
testcase_12 | AC | 42 ms
26,476 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 5 ms
5,152 KB |
testcase_15 | AC | 8 ms
6,400 KB |
testcase_16 | AC | 16 ms
11,684 KB |
testcase_17 | AC | 10 ms
8,020 KB |
testcase_18 | AC | 23 ms
15,388 KB |
testcase_19 | AC | 18 ms
12,548 KB |
testcase_20 | AC | 25 ms
16,924 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 19 ms
13,084 KB |
testcase_23 | AC | 40 ms
25,776 KB |
testcase_24 | AC | 42 ms
26,536 KB |
testcase_25 | AC | 41 ms
26,504 KB |
testcase_26 | AC | 38 ms
24,492 KB |
testcase_27 | AC | 40 ms
25,752 KB |
testcase_28 | AC | 41 ms
26,272 KB |
testcase_29 | AC | 41 ms
26,312 KB |
testcase_30 | AC | 38 ms
24,880 KB |
testcase_31 | AC | 39 ms
24,992 KB |
testcase_32 | AC | 41 ms
26,276 KB |
testcase_33 | AC | 39 ms
24,640 KB |
testcase_34 | AC | 40 ms
25,548 KB |
testcase_35 | AC | 38 ms
24,360 KB |
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <cassert> #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp" template <class T, class U> constexpr bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template <class T, class U> constexpr bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } /** * @title Chmin/Chmax */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" class range { public: class iterator { private: int64_t M_position; public: constexpr iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { ++M_position; } constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; class reverse_iterator { private: int64_t M_position; public: constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { --M_position; } constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; private: const iterator M_first, M_last; public: constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { } constexpr iterator begin() const noexcept { return M_first; } constexpr iterator end() const noexcept { return M_last; } constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } }; /** * @title Range */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp" #include <type_traits> #include <iterator> #line 6 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp" template <class T> class rev_impl { public: using iterator = decltype(std::rbegin(std::declval<T>())); private: const iterator M_begin; const iterator M_end; public: constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { } constexpr iterator begin() const noexcept { return M_begin; } constexpr iterator end() const noexcept { return M_end; } }; template <class T> constexpr decltype(auto) rev(T &&cont) { return rev_impl<T>(std::forward<T>(cont)); } /** * @title Reverser */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/modular.cpp" #include <cstdint> #line 5 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/modular.cpp" template <class Modulus> class modular { public: using value_type = uint32_t; using cover_type = uint64_t; static constexpr value_type mod() { return Modulus::value(); } template <class T> static constexpr value_type normalize(T value_) noexcept { if (value_ < 0) { value_ = -value_; value_ %= mod(); if (value_ == 0) return 0; return mod() - value_; } return value_ % mod(); } private: value_type value; public: constexpr modular() noexcept : value(0) { } template <class T> explicit constexpr modular(T value_) noexcept : value(normalize(value_)) { } template <class T> explicit constexpr operator T() const noexcept { return static_cast<T>(value); } constexpr value_type get() const noexcept { return value; } constexpr value_type &extract() noexcept { return value; } constexpr modular operator - () const noexcept { return modular(mod() - value); } constexpr modular operator ~ () const noexcept { return inverse(*this); } constexpr modular operator + (const modular &rhs) const noexcept { return modular(*this) += rhs; } constexpr modular& operator += (const modular &rhs) noexcept { if ((value += rhs.value) >= mod()) value -= mod(); return *this; } constexpr modular operator - (const modular &rhs) const noexcept { return modular(*this) -= rhs; } constexpr modular& operator -= (const modular &rhs) noexcept { if ((value += mod() - rhs.value) >= mod()) value -= mod(); return *this; } constexpr modular operator * (const modular &rhs) const noexcept { return modular(*this) *= rhs; } constexpr modular& operator *= (const modular &rhs) noexcept { value = (cover_type) value * rhs.value % mod(); return *this; } constexpr modular operator / (const modular &rhs) const noexcept { return modular(*this) /= rhs; } constexpr modular& operator /= (const modular &rhs) noexcept { return (*this) *= inverse(rhs); } constexpr bool zero() const noexcept { return value == 0; } constexpr bool operator == (const modular &rhs) const noexcept { return value == rhs.value; } constexpr bool operator != (const modular &rhs) const noexcept { return value != rhs.value; } friend std::ostream& operator << (std::ostream &stream, const modular &rhs) { return stream << rhs.value; } friend constexpr modular inverse(modular val) noexcept { return power(val, mod() - 2); } friend constexpr modular power(modular val, cover_type exp) noexcept { modular res(1); for (; exp > 0; exp >>= 1, val *= val) if (exp & 1) res *= val; return res; } }; template <uint32_t Val> struct modulus_impl { static constexpr uint32_t value() noexcept { return Val; } }; template <uint32_t Val> using mint32_t = modular<modulus_impl<Val>>; struct runtime_mod { static uint32_t &value() noexcept { static uint32_t val = 0; return val; } }; using rmint32_t = modular<runtime_mod>; /** * @title Modint */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/fix_point.cpp" #line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/fix_point.cpp" template <class Func> struct fix_point_impl: private Func { explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { } template <class... Args> constexpr decltype(auto) operator () (Args &&... args) const { return Func::operator()(*this, std::forward<Args>(args)...); } }; template <class Func> constexpr decltype(auto) fix_point(Func &&func) { return fix_point_impl<Func>(std::forward<Func>(func)); } /** * @title Lambda Recursion */ #line 19 "main.cpp" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; using m32 = mint32_t<1000000007>; int main() { i32 N, C; std::cin >> N >> C; std::vector<std::vector<i32>> graph(N); for (auto i: range(1, N)) { i32 u, v; std::cin >> u >> v; --u; --v; graph[u].push_back(v); graph[v].push_back(u); } const auto K = std::min(6 * N, C); std::vector<std::vector<m32>> dp(N, std::vector<m32>(K, m32(1))); fix_point([&](auto dfs, const i32 u, const i32 p) -> void { for (const auto v: graph[u]) { if (v != p) { dfs(v, u); for (auto j: range(0, K)) { m32 coeff; if (j - 3 >= 0) { coeff += dp[v][j - 3]; } if (j + 3 < K) { coeff += dp[v][j + 3]; } dp[u][j] *= coeff; } } } })(0, -1); const auto ans = std::accumulate(dp[0].begin(), dp[0].end(), m32()); const auto add = m32(C - K) * power(m32(2), N - 1); std::cout << ans + add << '\n'; return 0; }