#551879 (C++17) No.1227 I hate ThREE

提出ソース

結果

問題	No.1227 I hate ThREE
ユーザー	opt
提出日時	2020-09-11 23:16:27
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	52 ms / 2,000 ms
コード長	5,803 bytes
コンパイル時間	2,567 ms
コンパイル使用メモリ	210,836 KB
実行使用メモリ	26,880 KB
最終ジャッジ日時	2024-06-10 14:44:06
合計ジャッジ時間	4,109 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	3 ms 6,940 KB
testcase_04	AC	3 ms 6,940 KB
testcase_05	AC	4 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	5 ms 6,940 KB
testcase_09	AC	5 ms 6,940 KB
testcase_10	AC	3 ms 6,940 KB
testcase_11	AC	26 ms 6,940 KB
testcase_12	AC	29 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	5 ms 6,940 KB
testcase_15	AC	6 ms 6,940 KB
testcase_16	AC	12 ms 6,944 KB
testcase_17	AC	8 ms 6,944 KB
testcase_18	AC	17 ms 6,940 KB
testcase_19	AC	13 ms 6,944 KB
testcase_20	AC	18 ms 6,940 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	14 ms 6,940 KB
testcase_23	AC	50 ms 25,728 KB
testcase_24	AC	52 ms 18,816 KB
testcase_25	AC	52 ms 26,880 KB
testcase_26	AC	28 ms 6,940 KB
testcase_27	AC	30 ms 6,940 KB
testcase_28	AC	31 ms 6,940 KB
testcase_29	AC	31 ms 6,944 KB
testcase_30	AC	29 ms 6,944 KB
testcase_31	AC	29 ms 6,940 KB
testcase_32	AC	30 ms 6,944 KB
testcase_33	AC	27 ms 6,940 KB
testcase_34	AC	30 ms 6,944 KB
testcase_35	AC	28 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
using ll = long long;
using ld = long double;
using Vi = V<int>;  using VVi = V<Vi>;
using Vl = V<ll>;   using VVl = V<Vl>;
using Vd = V<ld>;   using VVd = V<Vd>;
using Vb = V<bool>; using VVb = V<Vb>;
using Pi = P<int>;
using Pl = P<ll>;
using Pd = P<ld>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline ll cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = 1<<30;
// const ll INFll = 1ll<<60;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


template<int MOD> struct ModInt {
  int x;
  ModInt(ll _x = 0) : x( (0 <= _x && _x < MOD) ? _x : (_x%MOD+MOD)%MOD ) {}
  constexpr int &value() noexcept { return x; }
  constexpr ModInt operator-() const noexcept { return ModInt(MOD-x); }
  constexpr ModInt operator+(const ModInt y) const noexcept { return ModInt(*this) += y; }
  constexpr ModInt operator-(const ModInt y) const noexcept { return ModInt(*this) -= y; }
  constexpr ModInt operator*(const ModInt y) const noexcept { return ModInt(*this) *= y; }
  constexpr ModInt operator/(const ModInt y) const noexcept { return ModInt(*this) /= y; }
  constexpr ModInt &operator+=(const ModInt y) noexcept { x += y.x; if (x >= MOD) x -= MOD; return *this; }
  constexpr ModInt &operator-=(const ModInt y) noexcept { x -= y.x; if (x < 0) x += MOD; return *this; }
  constexpr ModInt &operator*=(const ModInt y) noexcept { x = ll(x) * y.x % MOD; return *this; }
  constexpr ModInt &operator/=(const ModInt y) {
    int a = y.x, b = MOD, u = 1, v = 0;
    while (b) {
      int t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    x = ll(x) * u % MOD;
    if (x < 0) x += MOD;
    return *this;
  }
  constexpr ModInt pow(ll n) const noexcept {
    ModInt x(1);
    ModInt a = *this;
    for (; n > 0; n >>= 1, a *= a) if (n&1) x *= a;
    return x;
  }
};
using mint = ModInt<MOD>;
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;
istream &operator>>(istream &is, mint &a) { ll v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }


VVi G;
int n, c, m;
int l, r;


Vm dfs(int u, int p=-1) {
  Vm res(c, 1);
  for (int v : G[u]) if (v != p) {
    auto res_v = dfs(v, u);
    rep(i, c) {
      mint now = 0;
      if (i-3 >= 0) now += res_v[i-3];
      if (i+3 < c) now += res_v[i+3];
      res[i] *= now;
    }
  }
  return res;
}


Vm dfs2(int u, int p=-1) {
  Vm res(2*m+1, 1);
  for (int v : G[u]) if (v != p) {
    auto res_v = dfs2(v, u);
    rep(i, m+1) {
      mint now = 0;
      if (i-3 >= 0) now += res_v[i-3];
      if (i+3 <= m) now += res_v[i+3];
      else now += res_v[m];
      res[i] *= now;
    }
    rep2(i, m+1, 2*m+1) {
      mint now = 0;
      if (i-3 >= m+1) now += res_v[i-3];
      else now += res_v[m];
      if (i+3 <= 2*m) now += res_v[i+3];
      res[i] *= now;
    }
  }
  return res;
}


int main() {
  cin >> n >> c;
  m = 3*n;
  
  G.assign(n, Vi());
  rep(i, n-1) {
    int u, v; cin >> u >> v;
    --u, --v;
    G[u].push_back(v);
    G[v].push_back(u);
  }

  mint ans = 0;

  if (c <= 2*m + 5) {
    auto res = dfs(0);
    rep(i, c) ans += res[i];
  }
  else {
    auto res = dfs2(0);
    rep(i, 2*m+1) if (i != m) ans += res[i];
    ans += res[m] * (c - 2*m);
  }

  cout <<  ans << '\n';
}


// 5 50
// 1 2
// 1 3
// 3 4
// 3 5

yukicoder

結果

テストケース

ソースコード