#1192704 (C++17) No.3762 Glowing Utility Pole

• 問題: No.3762 Glowing Utility Pole
• ユーザー: GOTKAKO
• 提出日時: 2026-10-10 03:11:08
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 1,174 ms / 2,000 ms
• コード長: 4,736 bytes
• コンパイル時間: 2,017 ms
• コンパイル使用メモリ: 230,432 KB
• 実行使用メモリ: 113,572 KB
• 最終ジャッジ日時: 2026-10-10 03:11:27
• 合計ジャッジ時間: 11,061 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge5_0

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

ソースコード

#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;

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

    int N,M; cin >> N >> M;
    int Limit = M; //Limit->必要なサイズ fac->x! facinv->1/x! inv->1/x.
    vector<mint> fac(Limit+1,1),facinv(Limit+1);
    {
        int mod = mint::getmod(),invstart = min(mod-1,Limit); 
        for(int i=1; i<=Limit; i++) fac.at(i) = fac.at(i-1)*i;
        facinv.at(invstart) = fac.at(invstart).inv();
        for(int i=invstart-1; i>=0; i--) facinv.at(i) = facinv.at(i+1)*(i+1);
    }
    vector<mint> inv(Limit+1); for(int i=1; i<=Limit; i++) inv.at(i) = fac.at(i-1)*facinv.at(i); //必要なら解放.
    auto nCr = [&](int n,int r) -> mint {
        if(n < r || r < 0 || n < 0) return 0;
        return fac.at(n)*facinv.at(r)*facinv.at(n-r);
    };

    vector<int> A(N);
    for(auto &a : A) cin >> a,a--;
    vector<int> Z(N+1);
    for(int i=1; i<=N; i++) Z.at(i) = Z.at(i-1)+(A.at(i-1)==-1);
    int zero = Z.at(N);
    vector<vector<int>> back(N+1,vector<int>(M,-1));
    for(int i=1; i<=N; i++){
        back.at(i) = back.at(i-1);
        if(A.at(i-1) != -1) back.at(i).at(A.at(i-1)) = i-1;
    }
    vector<vector<mint>> S(M,vector<mint>(N)),T(M,vector<mint>(N+1));
    for(int m=0; m<M; m++) for(int i=0; i<N; i++){
        if(i) S.at(m).at(i) = S.at(m).at(i-1);
        S.at(m).at(i) += (inv.at(M-m)*M).pow(Z.at(i));
        T.at(m).at(i+1) = (inv.at(M)*(M-m)).pow(Z.at(i+1));
    }

    mint answer = 0;
    {
        for(int r=1; r<=N; r++){
            int R = r,use = 0,c = 0;
            while(R){
                int near = -1,v = -1;
                for(int i=0; i<M; i++) if((!(use&(1<<i))) && back.at(R).at(i) > near) near = back.at(R).at(i),v = i;
                int L = near+1; R--;
                if(L < r) for(int i=0; i<=M-c; i++){
                    if(i == M) break;
                    mint s = S.at(i).at(R),now = nCr(M-c,i)*T.at(i).at(r);
                    if(i%2) now = -now;
                    if(L) s -= S.at(i).at(L-1);
                    answer += now*s;
                }
                R = L;
                if(v != -1) use += 1<<v,c++;
            }
        }
    }
    answer *= mint(M).pow(zero);
    cout << answer << endl;
}