結果

問題 No.2810 Have Another Go (Hard)
コンテスト
ユーザー risujiroh
提出日時 2024-07-12 21:45:23
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 231 ms / 3,000 ms
コード長 4,499 bytes
コンパイル時間 3,396 ms
コンパイル使用メモリ 256,468 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-12 21:45:40
合計ジャッジ時間 12,912 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 61
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

using Mint = atcoder::modint998244353;
constexpr Int N = 6;
using Vec = std::array<Mint, N>;
using Mat = std::array<Vec, N>;

Mat operator*(const Mat& x, const Mat& y) {
  Mat ret{};
  for (Int i : Rep(N)) {
    for (Int k : Rep(N)) {
      for (Int j : Rep(N)) {
        ret[i][j] += x[i][k] * y[k][j];
      }
    }
  }
  return ret;
}

Vec operator*(const Mat& x, const Vec& y) {
  Vec ret{};
  for (Int i : Rep(N)) {
    for (Int j : Rep(N)) {
      ret[i] += x[i][j] * y[j];
    }
  }
  return ret;
}

Mat pow(Mat x, Int n) {
  if (n == 0) {
    for (Int i : Rep(N)) {
      for (Int j : Rep(N)) {
        x[i][j] = i == j;
      }
    }
    return x;
  }
  for (; n % 2 == 0; n >>= 1) {
    x = x * x;
  }
  Mat ret = x;
  while (n >>= 1) {
    x = x * x;
    if (n % 2) {
      ret = ret * x;
    }
  }
  return ret;
}

void Solve() {
  Int n, m, q;
  Scan(n, m, q);

  Mat a{};
  Mat b{};
  a[0].fill(1);
  for (Int i : Rep(1, N)) {
    a[i][i - 1] = 1;
    b[i][i - 1] = 1;
  }

  Mint all = 0;
  {
    Vec v{};
    v[0] = 1;
    v = pow(a, n * m - 1) * v;
    for (Int i : Rep(N)) {
      all += v[i] * (N - i);
    }
  }

  Mat mid = b * pow(pow(a, n - 1) * b, m - 1);

  while (q--) {
    Int c;
    Scan(c);

    Vec v{};
    v[0] = 1;
    v = pow(a, c - 1) * v;
    v = mid * v;
    v = pow(a, n - c - 1) * v;

    Mint ans = 0;
    for (Int i : Rep(N)) {
      ans += v[i] * (N - i);
    }

    Print(all - ans);
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(std::numeric_limits<Float>::max_digits10);

  Solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

#include <atcoder/modint>

using Int = int64_t;
using Float = double;

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

inline constexpr auto Rev = views::reverse;
inline constexpr auto Map = views::transform;
inline constexpr auto Filter = views::filter;

constexpr auto Rep(Int l, Int r) { return views::iota(std::min(l, r), r); }
constexpr auto Rep(Int n) { return Rep(0, n); }
constexpr auto Rep1(Int l, Int r) { return Rep(l, r + 1); }
constexpr auto Rep1(Int n) { return Rep(1, n + 1); }

constexpr Int Sz(auto&& r) { return static_cast<Int>(ranges::size(r)); }

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); }

inline constexpr Int INF = [] { std::array<char, sizeof(Int)> a; a.fill(0x3f); return std::bit_cast<Int>(a); }();

template <class T> concept Range = ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept TupleLike = 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, TupleLike 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, TupleLike 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

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

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_;
};

#endif  // __INCLUDE_LEVEL__
0