#1173305 (C++23) No.3600 Moving Queen Many Times

• 問題: No.3600 Moving Queen Many Times
• ユーザー: Kude
• 提出日時: 2026-07-24 23:00:03
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 692 ms / 7,000 ms
• コード長: 3,478 bytes
• コンパイル時間: 2,329 ms
• コンパイル使用メモリ: 361,088 KB
• 実行使用メモリ: 11,904 KB
• 最終ジャッジ日時: 2026-07-24 23:00:29
• 合計ジャッジ時間: 10,633 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

ファイルパターン	結果
sample	AC * 3
other	AC * 75

ソースコード

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;



template<class T, T (*add)(T, T), T (*zero)(), T (*mul)(T, T), T (*one)(), int N>
struct Mat : array<array<T, N>, N> {
  using M = Mat<T, add, zero, mul, one, N>;
  void make_identity() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      (*this)[i][i] = one();
    }
  }
  M& operator+=(const M& rhs) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = add((*this)[i][j], rhs[i][j]);
      }
    }
    return *this;
  }
  M& operator*=(const M& rhs) {
    static M temp;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        temp[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        for (int k = 0; k < N; k++) {
          temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
        }
      }
    }
    *this = temp;
    return *this;
  }
  template <class I>
  void inplace_pow(I k) {
    assert(k >= 0);
    static M temp;
    temp = *this;
    make_identity();
    while (k) {
      if (k & 1) *this *= temp;
      k >>= 1;
      if (k) temp *= temp;
    }
  }
  friend ostream& operator<<(ostream& os, const M& A) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        os << A[i][j] << " \n"[j + 1 == N];
      }
    }
    return os;
  }
};

// mint
mint add(mint x, mint y) { return x + y; }
mint zero() { return mint(); }
mint mul(mint x, mint y) { return x * y; }
mint one() { return mint::raw(1); }
using M = Mat<mint, add, zero, mul, one, 16>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w, sx, sy, gx, gy;
  ll k;
  cin >> h >> w >> sx >> sy >> gx >> gy >> k;
  sx--, sy--, gx--, gy--;
  VI to[16];
  rep(i, h) rep(j, w) rep(ni, h) rep(nj, w) if ((i != ni || j != nj) && (i == ni || j == nj || i+j == ni+nj || i-j == ni-nj)) {
    to[i*w+j].emplace_back(ni*w+nj);
  }
  int n = h*w;
  M m;
  rep(i0, n) {
    static mint dp[1 << 16][16];
    rep(s, 1 << n) rep(i, n) dp[s][i] = mint();
    dp[0][i0] = 1;
    rep(s, 1 << n) rep(i, n) if (dp[s][i].val()) for (int j : to[i]) if (~s >> j & 1) {
      dp[s|1<<j][j] += dp[s][i];
    }
    rep(i, n) m[i0][i] = dp[(1<<n)-1][i];
  }
  ll q = k / n, r = k % n;
  m.inplace_pow(q);
  mint ans;
  rep(i0, n) {
    static mint dp[1 << 16][16];
    rep(s, 1 << n) rep(i, n) dp[s][i] = mint();
    dp[0][i0] = 1;
    rep(s, 1 << n) rep(i, n) if (dp[s][i].val()) for (int j : to[i]) if (~s >> j & 1) {
      dp[s|1<<j][j] += dp[s][i];
    }
    rep(s, 1 << n) if (popcount(0U + s) == r) {
      ans += m[sx*w+sy][i0] * dp[s][gx*w+gy];
    }
  }
  cout << ans.val() << '\n';
}