#1173384 (C++17) No.3600 Moving Queen Many Times

• 問題: No.3600 Moving Queen Many Times
• ユーザー: GOTKAKO
• 提出日時: 2026-07-24 23:22:33
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: WA
• 実行時間: -
• コード長: 4,335 bytes
• コンパイル時間: 1,358 ms
• コンパイル使用メモリ: 222,844 KB
• 実行使用メモリ: 178,176 KB
• 最終ジャッジ日時: 2026-07-24 23:22:43
• 合計ジャッジ時間: 8,082 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_1

ファイルパターン	結果
sample	AC * 2 WA * 1
other	AC * 34 WA * 41

ソースコード

#include <bits/stdc++.h>
using namespace std;

//入力が必ず-mod<=a<modの時.
template<const int mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint():v(0){}
    template<typename T>
    modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint &operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint &operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint &operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint &operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint &operator/=(modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return pow(mod-2);} //素数mod必須.
 
    modint &operator++(){*this += 1; return *this;}
    modint &operator--(){*this -= 1; return *this;}
    modint operator++(int){modint ret = *this; *this += 1; return ret;}
    modint operator--(int){modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const modint a,const modint b){return a.v==b.v;}
    friend bool operator!=(const modint a,const modint b){return a.v!=b.v;}
    friend bool operator<(const modint a,const modint b){return a.v<b.v;}
    friend bool operator<=(const modint a,const modint b){return a.v<=b.v;}
    friend bool operator>=(const modint a,const modint b){return a.v>=b.v;}
    friend bool operator>(const modint a,const modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = modint(x); return is;
    }
};
using mint = modint<998244353>; const long long mod = 998244353;

template<typename T>
vector<vector<T>> multima(vector<vector<T>> &A,vector<vector<T>> &B){
    assert(A.at(0).size() == B.size() && B.size());
    int H = A.size(),W = B.at(0).size();
    vector<vector<T>> ret(H,vector<T>(W));
    for(int i=0; i<H; i++) for(int k=0; k<W; k++){
        for(int l=0; l<A.at(i).size(); l++){
            ret.at(i).at(k) += A.at(i).at(l)*B.at(l).at(k);
        }
    }
    return ret; //計算できる行列のみ.
}
template<typename T>
vector<vector<T>> Powmat(vector<vector<T>> A,vector<vector<T>> B,long long N){ //return A^N*B ABは行列;
    //n*n行列A n*1行列Bと想定 O(n^3*logN).
    assert(A.size() && A.size() == A.at(0).size() && N >= 0);
    while(N){
        if(N&1) B = multima(A,B);
        A = multima(A,A); N >>= 1;
    }
    return B;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long H,W,sx,gx,sy,gy,K; cin >> H >> W >> sx >> sy >> gx >> gy >> K,sx--,sy--,gx--,gy--;
    long long N = H*W,n2 = 1<<N;
    long long loop = K/16; K %= 16;
    vector dp(n2,vector(N,vector<mint>(N)));
    for(int i=0; i<N; i++) dp[0][i][i] = 1;
    for(int s=1; s<n2; s++) for(int i=0; i<N; i++) for(int k=0; k<N; k++) if(s&(1<<k)){
        int x = k/W,y = k%W;
        for(int l=0; l<N; l++) if(k != l){
            int x2 = l/W,y2 = l%W;
            if(x == x2 || y == y2 || abs(x-x2) == abs(y-y2)) dp[s][i][k] += dp[s-(1<<k)][i][l];
        }
    }

    vector<vector<mint>> A = dp.back(),B(N,vector<mint>(1));
    B.at(sx*W+sy).at(0) = 1;
    if(loop) B = Powmat(A,B,loop);

    mint answer = 0;
    for(int s=0; s<n2; s++) for(int i=0; i<N; i++){
        if(__popcount((unsigned int)s) != K) continue;
        int k = gx*W+gy;
        answer += B.at(i).at(0)*dp[s][i][k];
    }
    cout << answer << endl;
}