結果
| 問題 | No.1227 I hate ThREE |
| ユーザー |
 jell
|
| 提出日時 | 2020-09-12 02:11:31 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 18,774 bytes |
| コンパイル時間 | 4,376 ms |
| コンパイル使用メモリ | 279,320 KB |
| 実行使用メモリ | 542,592 KB |
| 最終ジャッジ日時 | 2024-06-09 09:23:37 |
| 合計ジャッジ時間 | 38,332 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 1 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 16 ms
6,016 KB |
| testcase_04 | AC | 14 ms
5,376 KB |
| testcase_05 | AC | 54 ms
5,376 KB |
| testcase_06 | AC | 1 ms
5,376 KB |
| testcase_07 | AC | 2 ms
5,376 KB |
| testcase_08 | AC | 203 ms
5,376 KB |
| testcase_09 | AC | 162 ms
5,376 KB |
| testcase_10 | AC | 92 ms
5,376 KB |
| testcase_11 | AC | 1,635 ms
5,376 KB |
| testcase_12 | AC | 1,900 ms
6,940 KB |
| testcase_13 | AC | 23 ms
5,376 KB |
| testcase_14 | AC | 149 ms
6,016 KB |
| testcase_15 | AC | 243 ms
6,272 KB |
| testcase_16 | AC | 673 ms
8,548 KB |
| testcase_17 | AC | 382 ms
6,956 KB |
| testcase_18 | AC | 939 ms
10,720 KB |
| testcase_19 | AC | 792 ms
9,064 KB |
| testcase_20 | AC | 994 ms
9,112 KB |
| testcase_21 | AC | 9 ms
5,376 KB |
| testcase_22 | AC | 706 ms
9,600 KB |
| testcase_23 | TLE | - |
| testcase_24 | TLE | - |
| testcase_25 | TLE | - |
| testcase_26 | AC | 1,715 ms
13,712 KB |
| testcase_27 | AC | 1,816 ms
14,064 KB |
| testcase_28 | AC | 1,797 ms
16,900 KB |
| testcase_29 | AC | 1,767 ms
15,288 KB |
| testcase_30 | AC | 1,876 ms
16,524 KB |
| testcase_31 | AC | 1,715 ms
11,824 KB |
| testcase_32 | AC | 1,794 ms
14,872 KB |
| testcase_33 | AC | 1,828 ms
13,344 KB |
| testcase_34 | AC | 1,719 ms
13,000 KB |
| testcase_35 | AC | 1,618 ms
12,676 KB |
ソースコード
#line 1 "yukicoder\\b.cpp"
#include <bits/extc++.h>
#line 5 "Library\\config.hpp"
namespace config {
const auto start_time{std::chrono::system_clock::now()};
int64_t elapsed() {
using namespace std::chrono;
const auto end_time{system_clock::now()};
return duration_cast<milliseconds>(end_time - start_time).count();
}
__attribute__((constructor)) void setup() {
using namespace std;
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
#ifdef _buffer_check
atexit([] {
char bufc;
if (cin >> bufc)
cerr << "\n\033[43m\033[30mwarning: buffer not empty.\033[0m\n\n";
});
#endif
}
unsigned cases(void), caseid = 1;
template <class C> void main() {
for (const unsigned total = cases(); caseid <= total; ++caseid) C();
}
} // namespace config
#line 3 "Library\\gcc_builtin.hpp"
namespace workspace {
constexpr int clz32(const uint32_t &n) noexcept { return __builtin_clz(n); }
constexpr int clz64(const uint64_t &n) noexcept{ return __builtin_clzll(n); }
constexpr int ctz(const uint64_t &n) noexcept { return __builtin_ctzll(n); }
constexpr int popcnt(const uint64_t &n) noexcept { return __builtin_popcountll(n); }
} // namespace workspace
#line 2 "Library\\gcc_option.hpp"
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")
#endif
#line 5 "Library\\utils\\binary_search.hpp"
namespace workspace {
// binary search on discrete range.
template <class iter_type, class pred_type>
std::enable_if_t<
std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,
iter_type>
binary_search(iter_type ok, iter_type ng, pred_type pred) {
assert(ok != ng);
__int128_t dist(ng - ok);
while (dist > 1 || dist < -1) {
iter_type mid(ok + dist / 2);
if (pred(mid))
ok = mid, dist -= dist / 2;
else
ng = mid, dist /= 2;
}
return ok;
}
// parallel binary search on discrete range.
template <class iter_type, class pred_type>
std::enable_if_t<std::is_convertible_v<
std::invoke_result_t<pred_type, std::vector<iter_type>>,
std::vector<bool>>,
std::vector<iter_type>>
binary_search(std::vector<std::pair<iter_type, iter_type>> ends,
pred_type pred) {
std::vector<iter_type> mids(ends.size());
for (;;) {
bool all_found = true;
for (size_t i{}; i != ends.size(); ++i) {
auto [ok, ng] = ends[i];
iter_type mid(ok + (ng - ok) / 2);
if (mids[i] != mid) {
all_found = false;
mids[i] = mid;
}
}
if (all_found) break;
auto res = pred(mids);
for (size_t i{}; i != ends.size(); ++i) {
(res[i] ? ends[i].first : ends[i].second) = mids[i];
}
}
return mids;
}
// binary search on real numbers.
template <class real_type, class pred_type>
std::enable_if_t<
std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,
real_type>
binary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {
assert(ok != ng);
while (ok + eps < ng || ng + eps < ok) {
real_type mid{(ok + ng) / 2};
(pred(mid) ? ok : ng) = mid;
}
return ok;
}
// parallel binary search on real numbers.
template <class real_type, class pred_type>
std::enable_if_t<std::is_convertible_v<
std::invoke_result_t<pred_type, std::vector<real_type>>,
std::vector<bool>>,
std::vector<real_type>>
binary_search(std::vector<std::pair<real_type, real_type>> ends,
const real_type eps, pred_type pred) {
std::vector<real_type> mids(ends.size());
for (;;) {
bool all_found = true;
for (size_t i{}; i != ends.size(); ++i) {
auto [ok, ng] = ends[i];
if (ok + eps < ng || ng + eps < ok) {
all_found = false;
mids[i] = (ok + ng) / 2;
}
}
if (all_found) break;
auto res = pred(mids);
for (size_t i{}; i != ends.size(); ++i) {
(res[i] ? ends[i].first : ends[i].second) = mids[i];
}
}
return mids;
}
} // namespace workspace
#line 3 "Library\\utils\\casefmt.hpp"
namespace workspace {
std::ostream &casefmt(std::ostream& os) { return os << "Case #" << config::caseid << ": "; }
} // namespace workspace
#line 3 "Library\\utils\\chval.hpp"
namespace workspace {
template <class T, class Comp = std::less<T>> bool chle(T &x, const T &y, Comp comp = Comp()) { return comp(y, x) ? x = y, true : false; }
template <class T, class Comp = std::less<T>> bool chge(T &x, const T &y, Comp comp = Comp()) { return comp(x, y) ? x = y, true : false; }
} // namespace workspace
#line 3 "Library\\utils\\fixed_point.hpp"
namespace workspace {
// specify the return type of lambda.
template <class lambda_type>
class fixed_point
{
lambda_type func;
public:
fixed_point(lambda_type &&f) : func(std::move(f)) {}
template <class... Args> auto operator()(Args &&... args) const { return func(*this, std::forward<Args>(args)...); }
};
} // namespace workspace
#line 3 "Library\\utils\\sfinae.hpp"
#include <type_traits>
template <class type, template <class> class trait>
using enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;
template <class Container>
using element_type = typename std::decay<decltype(
*std::begin(std::declval<Container&>()))>::type;
template <class T, class = void> struct is_integral_ext : std::false_type {};
template <class T>
struct is_integral_ext<
T, typename std::enable_if<std::is_integral<T>::value>::type>
: std::true_type {};
template <> struct is_integral_ext<__int128_t> : std::true_type {};
template <> struct is_integral_ext<__uint128_t> : std::true_type {};
template <class T>
constexpr static bool is_integral_ext_v = is_integral_ext<T>::value;
template <typename T, typename = void> struct multiplicable_uint {
using type = uint_least32_t;
};
template <typename T>
struct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {
using type = uint_least64_t;
};
template <typename T>
struct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {
using type = __uint128_t;
};
#line 7 "Library\\utils\\hash.hpp"
namespace workspace {
template <class T, class = void>
struct hash : std::hash<T> {};
template <class Unique_bits_type>
struct hash<Unique_bits_type, enable_if_trait_type<Unique_bits_type, std::has_unique_object_representations>>
{
size_t operator()(uint64_t x) const
{
static const uint64_t m = std::random_device{}();
x ^= x >> 23;
// x *= 0x2127599bf4325c37ULL;
x ^= m;
x ^= x >> 47;
return x - (x >> 32);
}
};
template <class Key>
size_t hash_combine(const size_t &seed, const Key &key)
{
return seed ^ (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */ );
}
template <class T1, class T2>
struct hash<std::pair<T1, T2>>
{
size_t operator()(const std::pair<T1, T2> &pair) const
{
return hash_combine(hash<T1>()(pair.first), pair.second);
}
};
template <class... T>
class hash<std::tuple<T...>>
{
template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1> struct tuple_hash { static uint64_t apply(const Tuple &t) { return hash_combine(tuple_hash<Tuple, index - 1>::apply(t), std::get<index>(t)); } };
template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> { static uint64_t apply(const Tuple &t) { return 0; } };
public:
uint64_t operator()(const std::tuple<T...> &t) const { return tuple_hash<std::tuple<T...>>::apply(t); }
};
template <class hash_table>
struct hash_table_wrapper : hash_table
{
using key_type = typename hash_table::key_type;
size_t count(const key_type &key) const { return hash_table::find(key) != hash_table::end(); }
template <class... Args> auto emplace(Args&&... args) { return hash_table::insert(typename hash_table::value_type(args...)); }
};
template <class Key, class Mapped = __gnu_pbds::null_type>
using cc_hash_table = hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped = __gnu_pbds::null_type>
using gp_hash_table = hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped>
using unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;
template <class Key>
using unordered_set = std::unordered_set<Key, hash<Key>>;
} // namespace workspace
#line 3 "Library\\utils\\make_vector.hpp"
namespace workspace {
template <typename T, size_t N>
constexpr auto make_vector(size_t* sizes, T const& init = T()) {
if constexpr (N)
return std::vector(*sizes, make_vector<T, N - 1>(std::next(sizes), init));
else
return init;
}
template <typename T, size_t N>
constexpr auto make_vector(const size_t (&sizes)[N], T const& init = T()) {
return make_vector<T, N>((size_t*)sizes, init);
}
} // namespace workspace
#line 3 "Library\\utils\\read.hpp"
namespace workspace {
// read with std::cin.
template <class T = void>
struct read
{
typename std::remove_const<T>::type value;
template <class... types>
read(types... args) : value(args...) { std::cin >> value; }
operator T() const { return value; }
};
template <>
struct read<void>
{
template <class T>
operator T() const { T value; std::cin >> value; return value; }
};
} // namespace workspace
#line 4 "Library\\utils\\stream.hpp"
#line 6 "Library\\utils\\stream.hpp"
namespace std {
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
return is >> p.first >> p.second;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << ' ' << p.second;
}
template <class tuple_t, size_t index> struct tuple_is {
static istream &apply(istream &is, tuple_t &t) {
tuple_is<tuple_t, index - 1>::apply(is, t);
return is >> get<index>(t);
}
};
template <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {
static istream &apply(istream &is, tuple_t &t) { return is; }
};
template <class... T> istream &operator>>(istream &is, tuple<T...> &t) {
return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,
t);
}
template <class tuple_t, size_t index> struct tuple_os {
static ostream &apply(ostream &os, const tuple_t &t) {
tuple_os<tuple_t, index - 1>::apply(os, t);
return os << ' ' << get<index>(t);
}
};
template <class tuple_t> struct tuple_os<tuple_t, 0> {
static ostream &apply(ostream &os, const tuple_t &t) {
return os << get<0>(t);
}
};
template <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {
static ostream &apply(ostream &os, const tuple_t &t) { return os; }
};
template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {
return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,
t);
}
template <class Container, typename Value = element_type<Container>>
typename enable_if<!is_same<typename decay<Container>::type, string>::value &&
!is_same<typename decay<Container>::type, char *>::value,
istream &>::type
operator>>(istream &is, Container &cont) {
for (auto &&e : cont) is >> e;
return is;
}
template <class Container, typename Value = element_type<Container>>
typename enable_if<!is_same<typename decay<Container>::type, string>::value &&
!is_same<typename decay<Container>::type, char *>::value,
ostream &>::type
operator<<(ostream &os, const Container &cont) {
bool head = true;
for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;
return os;
}
} // namespace std
#line 14 "yukicoder\\b.cpp"
namespace workspace {
constexpr char eol = '\n';
using namespace std;
using i64 = int_least64_t;
using p32 = pair<int, int>;
using p64 = pair<i64, i64>;
template <class T, class Comp = std::less<T>>
using priority_queue = std::priority_queue<T, std::vector<T>, Comp>;
template <class T> using stack = std::stack<T, std::vector<T>>;
struct solver;
} // namespace workspace
int main() { config::main<workspace::solver>(); }
unsigned config::cases() {
// return -1; // not specify
// int t; std::cin >> t; return t; // given
return 1;
}
#line 4 "Library\\modulus\\modint.hpp"
#line 6 "Library\\modulus\\modint.hpp"
template <auto Mod = 0, typename Mod_type = decltype(Mod)> struct modint {
static_assert(is_integral_ext<decltype(Mod)>::value,
"Mod must be integral type.");
static_assert(!(Mod < 0), "Mod must be non-negative.");
using mod_type = typename std::conditional<
Mod != 0, typename std::add_const<Mod_type>::type, Mod_type>::type;
static mod_type mod;
using value_type = typename std::decay<mod_type>::type;
constexpr operator value_type() const noexcept { return value; }
constexpr static modint one() noexcept { return 1; }
constexpr modint() noexcept = default;
template <class int_type,
typename std::enable_if<is_integral_ext<int_type>::value>::type * =
nullptr>
constexpr modint(int_type n) noexcept : value((n %= mod) < 0 ? mod + n : n) {}
constexpr modint(bool n) noexcept : modint(int(n)) {}
constexpr modint operator++(int) noexcept {
modint t{*this};
return operator+=(1), t;
}
constexpr modint operator--(int) noexcept {
modint t{*this};
return operator-=(1), t;
}
constexpr modint &operator++() noexcept { return operator+=(1); }
constexpr modint &operator--() noexcept { return operator-=(1); }
constexpr modint operator-() const noexcept {
return value ? mod - value : 0;
}
constexpr modint &operator+=(const modint &rhs) noexcept {
return (value += rhs.value) < mod ? 0 : value -= mod, *this;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
return (value += mod - rhs.value) < mod ? 0 : value -= mod, *this;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
return value = (typename multiplicable_uint<value_type>::type)value *
rhs.value % mod,
*this;
}
constexpr modint &operator/=(const modint &rhs) noexcept {
return operator*=(rhs.inverse());
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator+(const int_type &rhs) const noexcept {
return modint{*this} += rhs;
}
constexpr modint operator+(const modint &rhs) const noexcept {
return modint{*this} += rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator-(const int_type &rhs) const noexcept {
return modint{*this} -= rhs;
}
constexpr modint operator-(const modint &rhs) const noexcept {
return modint{*this} -= rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator*(const int_type &rhs) const noexcept {
return modint{*this} *= rhs;
}
constexpr modint operator*(const modint &rhs) const noexcept {
return modint{*this} *= rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator/(const int_type &rhs) const noexcept {
return modint{*this} /= rhs;
}
constexpr modint operator/(const modint &rhs) const noexcept {
return modint{*this} /= rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator+(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) + rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator-(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) - rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator*(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) * rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator/(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) / rhs;
}
constexpr modint inverse() const noexcept {
assert(value);
value_type a{mod}, b{value}, u{}, v{1}, t{};
while (b)
t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v;
return {u};
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
power(int_type e) noexcept {
if (e < 0) e = e % (mod - 1) + mod - 1;
modint res{1}, p{*this};
for (modint p{value}; e; e >>= 1, p *= p) {
if (e & 1) res *= p;
}
return res;
}
friend std::ostream &operator<<(std::ostream &os,
const modint &rhs) noexcept {
return os << rhs.value;
}
friend std::istream &operator>>(std::istream &is, modint &rhs) noexcept {
intmax_t value;
rhs = (is >> value, value);
return is;
}
protected:
value_type value = 0;
};
template <auto Mod, typename Mod_type>
typename modint<Mod, Mod_type>::mod_type modint<Mod, Mod_type>::mod = Mod;
using modint_runtime = modint<0>;
#line 33 "yukicoder\\b.cpp"
struct workspace::solver {
using mint = modint<1000000007>;
solver() {
// start here!
int n;
cin >> n;
int c;
cin >> c;
vector<vector<int>> tr(n);
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
--a, --b;
tr[a].emplace_back(b);
tr[b].emplace_back(a);
}
using table = unordered_map<int, mint>;
auto dp = fixed_point([&](auto dfs, int now, int pre) -> table {
bool is_root = !~pre;
if (!is_root) tr[now].erase(find(begin(tr[now]), end(tr[now]), pre));
table dp;
for (int i = 1; i <= c and i <= n * 6; i++) dp[i] = 1;
for (int i = 0, j = c; i < 6 * n and j > 0; j--, i++) dp[j] = 1;
for (int to : tr[now]) {
auto cdp = dfs(to, now);
int i;
for (i = 1; i < 6 * n and i <= c; i++) dp[i] *= cdp[i - 3] + cdp[i + 3];
for (int j = c; j >= i and c - j < 6 * n; j--)
dp[j] *= cdp[j - 3] + cdp[j + 3];
}
return dp;
})(0, -1);
// answer
mint ans;
{
int k, l;
for (k = 1; k <= c && k <= n * 3; k++) {
ans += dp[k];
}
for (l = c; l > k && l > c - n * 3; l--) {
ans += dp[l];
}
ans += max(0, l - k + 1) * dp[n * 3];
}
cout << ans << eol;
}
};