結果

問題 No.1821 LEQ-GEQ Permutations
ユーザー rianoriano
提出日時 2021-12-29 23:36:58
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 315 ms / 2,500 ms
コード長 4,555 bytes
コンパイル時間 1,845 ms
コンパイル使用メモリ 175,104 KB
実行使用メモリ 52,208 KB
最終ジャッジ日時 2023-07-27 18:50:49
合計ジャッジ時間 5,175 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 5 ms
4,380 KB
testcase_08 AC 17 ms
5,492 KB
testcase_09 AC 220 ms
37,108 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 20 ms
5,940 KB
testcase_12 AC 17 ms
5,484 KB
testcase_13 AC 43 ms
9,452 KB
testcase_14 AC 95 ms
17,844 KB
testcase_15 AC 199 ms
33,932 KB
testcase_16 AC 190 ms
32,624 KB
testcase_17 AC 88 ms
16,504 KB
testcase_18 AC 314 ms
52,208 KB
testcase_19 AC 315 ms
52,160 KB
testcase_20 AC 313 ms
52,156 KB
testcase_21 AC 314 ms
52,164 KB
testcase_22 AC 315 ms
52,208 KB
testcase_23 AC 4 ms
4,380 KB
testcase_24 AC 3 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)
using Graph = vector<vector<int>>;

const ll mod = 998244353;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint modinv(long long a, long long m = mod) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))


//Combination2
//10^6くらいまで
vector<ll> fact;
vector<ll> invf;
ll comb(ll n,ll k){
    if(n<0||k<0||k>n) return 0LL;
    else{
        ll a = fact[n]*invf[k]%mod;
        a = a*invf[n-k]%mod;
        return a;
    }
}
    


int main() {
    riano_; mint ans = 0;
	ll N; cin >> N;
    //main関数内に以下ペースト
    //N:max
    fact.assign(N+1,1LL);
    invf.assign(N+1,1LL);
    rep(i,N) fact[i+1] = fact[i]*(i+1)%mod;
    rep(i,N+1) invf[i] = modinv(fact[i],mod).val;
    string S; cin >> S;
    ll K = 0;
    rep(i,N){
        if(S[i]=='0') K++;
    }

    auto dp = v2m(K+2,N-K+2,0);
    dp[0][0] = 1;
    rep(i,K+1){
        rep(j,N-K+1){
            dp[i+1][j+1] += mint(i+j+1)*dp[i][j];
            dp[i+1][j] += mint(j)*dp[i][j];
            dp[i][j+1] += mint(i)*dp[i][j];
        }
    }
    
    rep(i,K+1){
        rep(j,N-K+1){
            ans += dp[i][j]*mint(fact[i])*mint(fact[j])*mint(comb(K,i))*mint(comb(N-K,j))*
                    mint(fact[K-i])*mint(fact[N-K-j])*mint(comb(N,K-i))*mint(comb(N-K+i,N-K-j));
        }
    }

    cout << ans << endl;
}
0