結果
問題 | No.1227 I hate ThREE |
ユーザー |
![]() |
提出日時 | 2020-09-11 23:29:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 11,110 bytes |
コンパイル時間 | 6,272 ms |
コンパイル使用メモリ | 234,116 KB |
最終ジャッジ日時 | 2025-01-14 11:55:58 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 TLE * 2 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); returnvec; }template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }#if __cplusplus >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},tpl); return os; }#endiftemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; returnos; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first <<"=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCAL#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl#else#define dbg(x)#endiftemplate <int mod>struct ModInt{using lint = long long;static int get_mod() { return mod; }static int get_primitive_root() {static int primitive_root = 0;if (!primitive_root) {primitive_root = [&](){std::set<int> fac;int v = mod - 1;for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;if (v > 1) fac.insert(v);for (int g = 1; g < mod; g++) {bool ok = true;for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; }if (ok) return g;}return -1;}();}return primitive_root;}int val;constexpr ModInt() : val(0) {}constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; }constexpr ModInt(lint v) { _setval(v % mod + mod); }explicit operator bool() const { return val != 0; }constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); }constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); }constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); }constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); }constexpr ModInt operator-() const { return ModInt()._setval(mod - val); }constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); }friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); }friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); }friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); }constexpr bool operator==(const ModInt &x) const { return val == x.val; }constexpr bool operator!=(const ModInt &x) const { return val != x.val; }bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map<ModInt, T>friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val; return os; }constexpr lint power(lint n) const {lint ans = 1, tmp = this->val;while (n) {if (n & 1) ans = ans * tmp % mod;tmp = tmp * tmp % mod;n /= 2;}return ans;}constexpr lint inv() const { return this->power(mod - 2); }constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); }constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; }inline ModInt fac() const {static std::vector<ModInt> facs;int l0 = facs.size();if (l0 > this->val) return facs[this->val];facs.resize(this->val + 1);for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs.at(i - 1) * ModInt(i));return facs[this->val];}ModInt doublefac() const {lint k = (this->val + 1) / 2;if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac();else return ModInt(k).fac() * ModInt(2).power(k);}ModInt nCr(const ModInt &r) const {if (this->val < r.val) return ModInt(0);return this->fac() / ((*this - r).fac() * r.fac());}ModInt sqrt() const {if (val == 0) return 0;if (mod == 2) return val;if (power((mod - 1) / 2) != 1) return 0;ModInt b = 1;while (b.power((mod - 1) / 2) == 1) b += 1;int e = 0, m = mod - 1;while (m % 2 == 0) m >>= 1, e++;ModInt x = power((m - 1) / 2), y = (*this) * x * x;x *= (*this);ModInt z = b.power(m);while (y != 1) {int j = 0;ModInt t = y;while (t != 1) j++, t *= t;z = z.power(1LL << (e - j - 1));x *= z, z *= z, y *= z;e = j;}return ModInt(std::min(x.val, mod - x.val));}};using mint = ModInt<1000000007>;struct rand_int_{using lint = long long;mt19937 mt;rand_int_() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}lint operator()(lint x) { return this->operator()(0, x); } // [0, x)lint operator()(lint l, lint r) {uniform_int_distribution<lint> d(l, r - 1);return d(mt);}} rnd;int main(){int N, C;cin >> N >> C;vector<vector<int>> to(N);REP(_, N - 1){int a, b;cin >> a >> b;a--, b--;to[a].emplace_back(b);to[b].emplace_back(a);}int root = rnd(N);vector<int> stsz(N);vector<pint> dfsjun;auto dfs_stsz = [&](auto &&dfs_stsz, int now, int prv) -> void {stsz[now] = 1;for (auto nxt : to[now]) if (nxt != prv){dfs_stsz(dfs_stsz, nxt, now);stsz[now] += stsz[nxt];}dfsjun.emplace_back(now, prv);};dfs_stsz(dfs_stsz, root, -1);vector<vector<vector<mint>>> info(N);auto dfs = [&](int now, int prv) -> void {vector<vector<mint>> ret(1, vector<mint>(1, 1));int maxsz = 0;vector<pair<int, vector<vector<mint>>>> nxtmats;for (auto nxt : to[now]) if (nxt != prv){int sz = info[nxt].size();nxtmats.emplace_back(make_pair(sz, info[nxt]));info[nxt].clear();}sort(nxtmats.begin(), nxtmats.end());for (auto [_, dpnxt] : nxtmats){int sz = dpnxt.size() - 3;chmax(maxsz, sz);auto v = ret.back();ret.resize(2 + sz, v);for (auto &vec : ret){auto v = vec.back();vec.resize(2 + sz, v);}REP(i, ret.size()) REP(j, ret[i].size()){ret.at(i).at(j) *= mint((i and j <= sz + 1) ? dpnxt.at(i - 1).at(j + 1) : 0) + mint((j and i <= sz + 1) ? dpnxt.at(i + 1).at(j - 1) :0);}}auto v = ret.back();ret.resize(maxsz + 4, v);for (auto &vec : ret){auto v = vec.back();vec.resize(maxsz + 4, v);}info[now] = ret;};for (auto [now, prv] : dfsjun) dfs(now, prv);auto mat = info[root];REP(i, mat.size()) IREP(j, mat[i].size() - 1){mat[i][j + 1] -= mat.at(i).at(j);}IREP(i, mat.size() - 1) REP(j, mat[i].size()){mat[i + 1][j] -= mat.at(i).at(j);}mint ret = 0;REP(i, mat.size()) REP(j, mat[i].size()){int coeff = C - 3 * (i + j);if (coeff > 0) ret += mat.at(i).at(j) * coeff;}cout << ret << '\n';}