#974511 (C++23) No.2733 Just K-times TSP

• 問題: No.2733 Just K-times TSP
• ユーザー: risujiroh
• 提出日時: 2024-04-19 23:08:08
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 134 ms / 2,000 ms
• コード長: 3,350 bytes
• コンパイル時間: 3,491 ms
• コンパイル使用メモリ: 258,780 KB
• 実行使用メモリ: 15,744 KB
• 最終ジャッジ日時: 2024-10-11 17:21:01
• 合計ジャッジ時間: 5,188 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	1 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	1 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	3 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	9 ms; 5,248 KB
testcase_18	AC	11 ms; 5,248 KB
testcase_19	AC	11 ms; 5,248 KB
testcase_20	AC	4 ms; 5,248 KB
testcase_21	AC	9 ms; 5,248 KB
testcase_22	AC	81 ms; 15,616 KB
testcase_23	AC	10 ms; 5,248 KB
testcase_24	AC	57 ms; 9,344 KB
testcase_25	AC	54 ms; 9,344 KB
testcase_26	AC	3 ms; 5,248 KB
testcase_27	AC	3 ms; 5,248 KB
testcase_28	AC	3 ms; 5,248 KB
testcase_29	AC	6 ms; 5,248 KB
testcase_30	AC	14 ms; 5,248 KB
testcase_31	AC	32 ms; 6,016 KB
testcase_32	AC	68 ms; 9,344 KB
testcase_33	AC	134 ms; 15,744 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

using mint = atcoder::modint998244353;

void solve() {
  int n, m, k;
  scan(n, m, k);
  std::vector<std::bitset<6>> g(n);
  while (m--) {
    int i, j;
    scan(i, j);
    --i, --j;
    g[i][j] = 1;
    g[j][i] = 1;
  }

  std::vector<int> pw(n + 1, 1);
  for (const int i : rep(n)) {
    pw[i + 1] = (k + 1) * pw[i];
  }

  std::vector<std::array<mint, 6>> f(pw[n]);

  for (const int i : rep(n)) {
    f[pw[i]][i] = 1;
  }

  for (const int C : rep(pw[n])) {
    for (const int i : rep(n)) {
      for (const int j : rep(n)) {
        if (g[i][j] && C / pw[j] % (k + 1) < k) {
          f[C + pw[j]][j] += f[C][i];
        }
      }
    }
  }

  mint ans = 0;
  for (const int i : rep(n)) {
    ans += f.back()[i];
  }
  print(ans);
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

#include <atcoder/modint>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class T, atcoder::internal::is_modint_t<T>* = nullptr>
istream& operator>>(istream& is, T& x) {
  int v;
  is >> v;
  x = T::raw(v);
  return is;
}

template <class T, atcoder::internal::is_modint_t<T>* = nullptr>
ostream& operator<<(ostream& os, const T& x) {
  return os << x.val();
}

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#endif  // __INCLUDE_LEVEL__