#1143257 (C++17) No.3176 転移迷宮 (Hard)

• 問題: No.3176 転移迷宮 (Hard)
• ユーザー: i_am_noob
• 提出日時: 2026-01-09 21:21:24
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 1,067 ms / 3,000 ms
• コード長: 11,106 bytes
• コンパイル時間: 2,721 ms
• コンパイル使用メモリ: 237,708 KB
• 実行使用メモリ: 28,264 KB
• 最終ジャッジ日時: 2026-01-09 21:21:56
• 合計ジャッジ時間: 31,742 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

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

ソースコード

// BEGIN: main.cpp
#line 1 "main.cpp"
#include<bits/stdc++.h>
using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

using ll=long long;
using u32=unsigned int;
using u64=unsigned long long;
using i128=__int128;
using u128=unsigned __int128;
using f128=__float128;

using pii=pair<int,int>;
using pll=pair<ll,ll>;

template<typename T> using vc=vector<T>;
template<typename T> using vvc=vc<vc<T>>;
template<typename T> using vvvc=vc<vvc<T>>;

using vi=vc<int>;
using vll=vc<ll>;
using vvi=vc<vi>;
using vvll=vc<vll>;

#define vv(type,name,n,...) \
    vector<vector<type>> name(n,vector<type>(__VA_ARGS__))
#define vvv(type,name,n,m,...) \
    vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__)))

template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>;
template<typename T> using max_heap=priority_queue<T>;

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))

template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);}
template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);}

template<typename T>
void sort_unique(vector<T> &vec){
    sort(vec.begin(),vec.end());
    vec.resize(unique(vec.begin(),vec.end())-vec.begin());
}

template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;}
template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;}

template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}
template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;}

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

template<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(T && x) {cout << x << "\n";}
template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);}

template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}

vvi read_graph(int n, int m, int base=1){
    vvi adj(n);
    for(int i=0,u,v; i<m; ++i){
        cin >> u >> v,u-=base,v-=base;
        adj[u].pb(v),adj[v].pb(u);
    }
    return adj;
}

vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);}

template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};}

template<typename T> constexpr T inf=0;
template<> constexpr int inf<int> = 0x3f3f3f3f;
template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f;

template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;}

template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;}

#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())

//#include<atcoder/all>
//using namespace atcoder;

//using mint=modint998244353;
//using mint=modint1000000007;

// BEGIN: library/mod/modint.hpp
#line 1 "library/mod/modint.hpp"

// BEGIN: library/nt/extgcd.hpp
#line 1 "library/nt/extgcd.hpp"

// ax + by = gcd(a,b), {gcd(a,b),x,y}
template<typename T>
array<T,3> extgcd(T a, T b){
    T x1=1,y1=0,x2=0,y2=1;
    while(b!=0){
        T q=a/b;
        a%=b;
        swap(a,b);
        T x3=x1-x2*q,y3=y1-y2*q;
        x1=x2,y1=y2,x2=x3,y2=y3;
    }
    return {a,x1,y1};
}

template<typename T>
T modinv(T x, T m){
    auto [g,val1,val2]=extgcd<T>(x,m);
    assert(g==1);
    if(val1<0) val1+=m;
    return val1;
}// END: library/nt/extgcd.hpp
#line 4 "library/mod/modint.hpp"

template<int64_t m, bool is_prime, typename word, typename dword>
struct Modint{
    using mint=Modint;

    static word get_mod(){
        return m;
    }

    word x;
    Modint():x(0){}
    Modint(int64_t _x):x((_x%m+m)%m){}

    mint operator += (const mint &o){
        x+=o.x;
        if(x>=m) x-=m;
        return *this;
    }
    mint operator -= (const mint &o){
        x-=o.x;
        if(x<0) x+=m;
        return *this;
    }
    mint operator *= (const mint &o){
        x=((dword)x)*o.x%m;
        return *this;
    }
    mint operator /= (const mint &o){
        return (*this)*=o.inv();
    }
    mint operator + (const mint &o) const {return mint(*this)+=o;}
    mint operator - (const mint &o) const {return mint(*this)-=o;}
    mint operator * (const mint &o) const {return mint(*this)*=o;}
    mint operator / (const mint &o) const {return mint(*this)/=o;}
    mint operator - () const {return mint(0)-*this;}
    mint pow(int64_t n) const {
        assert(n>=0);
        mint res=1,b=*this;
        for(; n; n>>=1,b*=b) if(n&1) res*=b;
        return res;
    }
    inline mint inv1() const {
        return pow(m-2);
    }
    inline mint inv2() const {
        auto [g,val1,val2]=extgcd<word>(x,m);
        assert(g==1);
        return mint(val1);
    }
    mint inv() const {
        if(is_prime) return inv1();
        return inv2();
    }

    bool operator == (const mint &o) const {
        return x==o.x;
    }
    bool operator != (const mint &o) const {
        return x!=o.x;
    }

    friend istream& operator >> (istream& is, mint &b){
        int64_t y;
        is >> y;
        b=mint(y);
        return is;
    }
    friend ostream& operator << (ostream& os, const mint &b){
        return os << b.x;
    }

    // v2(m-1), 2^(v2(m-1))-th root
    static constexpr pair<int,int> ntt_data(){
        if(m==998244353) return {23,31};
        return {-1,-1};
    }
};

template<int64_t m, bool is_prime=true> using modint=Modint<m,is_prime,int32_t,int64_t>;
template<int64_t m, bool is_prime=true> using modint_64=Modint<m,is_prime,int64_t,__int128>;// END: library/mod/modint.hpp
#line 113 "main.cpp"
using mint=modint<998244353>;
// BEGIN: library/linalg/solve_equation.hpp
#line 1 "library/linalg/solve_equation.hpp"

// BEGIN: library/linalg/arbitrary_matrix.hpp
#line 1 "library/linalg/arbitrary_matrix.hpp"

template<typename T>
struct matrix: vector<T>{
    using vector<T>::vector;

    int h,w;

    matrix(){
        h=w=0;
    }

    void set_hw(int _h, int _w){
        h=_h,w=_w;
        this->resize(h*w);
        for(int i=0; i<h*w; ++i) (*this)[i]=0;
    }
    /*
    static matrix id(int n){
        matrix res;
        res.set_hw(n,n);
        for(int i=0; i<n*n; ++i) res[i]=0;
        for(int i=0; i<n; ++i) res[i*n+i]=1;
        return res;
    }
    */
    matrix operator += (const matrix &mat2){
        assert(h==mat2.h&&w==mat2.w);
        for(int i=0; i<h*w; ++i) (*this)[i]+=mat2[i];
        return *this;
    }
    matrix operator -= (const matrix &mat2){
        assert(h==mat2.h&&w==mat2.w);
        for(int i=0; i<h*w; ++i) (*this)[i]-=mat2[i];
        return *this;
    }
    matrix operator *= (const matrix &mat2){
        assert(w==mat2.h);
        matrix res;
        res.set_hw(h,mat2.w);
        for(int i=0; i<h; ++i) for(int j=0; j<mat2.w; ++j){
            for(int k=0; k<w; ++k) res[i*mat2.w+j]+=(*this)[i*w+k]*mat2[k*mat2.w+j];
        }
        *this=res;
        return *this;
    }
    matrix operator *= (const T &x){
        for(int i=0; i<h*w; ++i) (*this)[i]*=x;
        return *this;
    }
    matrix operator + (const matrix &o) const {return matrix(*this)+=o;}
    matrix operator - (const matrix &o) const {return matrix(*this)-=o;}
    matrix operator * (const matrix &o) const {return matrix(*this)*=o;}
    matrix operator * (const T &o) const {return matrix(*this)*=o;}
};// END: library/linalg/arbitrary_matrix.hpp
#line 4 "library/linalg/solve_equation.hpp"

template<typename T>
matrix<T> solve_equation(vector<matrix<mint>> a){
    int n=a.size();
    for(int i=0; i<n; ++i){
        assert(a[i].h==1&&a[i].w==n+1);
    }
    for(int i=0; i<n; ++i){
        if(a[i][i]==T(0)){
            for(int j=i+1; j<n; ++j) if(a[j][i]!=T(0)){
                swap(a[i],a[j]);
                break;
            }
            if(a[i][i]==T(0)) return matrix<T>();
        }
        T x=T(1)/a[i][i];
        a[i]*=x;
        assert(a[i][i]==T(1));
        for(int j=0; j<n; ++j) if(i!=j) {
            x=-a[j][i];
            a[j]+=a[i]*x;
        }
    }
    matrix<T> res;
    res.set_hw(n,1);
    for(int i=0; i<n; ++i) res[i]=-a[i][n];
    return res;
}// END: library/linalg/solve_equation.hpp
#line 115 "main.cpp"

void mango(){
    int n,k; cin >> n >> k;
    mint tmp=mint(2*k+1).inv();
    vc<matrix<mint>> vec(n);
    if(n<=k+1){
        rep(n) vec[i].set_hw(1,n+1);
        rep(n){
            vec[i][i]+=mint(1);
            rep(j,-k,k+1){
                if(i+j>=0&&i+j<n) vec[i][i+j]-=tmp;
            }
            vec[i][n]-=mint(1);
        }
        matrix<mint> res=solve_equation<mint>(vec);
        rep(n) cout << res[i] << ' ';
        cout << "\n";
        return;
    }
    rep(k){
        vec[i].set_hw(1,k+1);
        vec[i][i]=1;
    }
    rep(n-k){
        vec[i+k]=vec[i];
        rep(j,-k,k){
            if(i+j>=0&&i+j<n) vec[i+k]-=vec[i+j]*tmp;
        }
        vec[i+k][k]-=mint(1);
        vec[i+k]*=mint(2*k+1);
    }
    vc<matrix<mint>> vec2;
    rep(i,n-k,n){
        matrix<mint> vv;
        vv.set_hw(1,k+1);
        vv=vec[i];
        rep(j,-k,k+1){
            if(i+j>=0&&i+j<n) vv-=vec[i+j]*tmp;
        }
        vv[k]-=mint(1);
        vv*=mint(2*k+1);
        vec2.pb(vv);
    }
    matrix<mint> res=solve_equation<mint>(vec2);
    res.h++;
    res.pb(mint(1));
    rep(n) cout << (vec[i]*res)[0] << ' ';
    cout << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cout << fixed << setprecision(20);
    int t=1;
    cin >> t;
    while(t--) mango();
}
// END: main.cpp