Submission #1543006

---

Source Code Expand

#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;

const int MAXN = 10001;
const int MOD = 998244353;

int pw(int a, int b = MOD - 2) {
    return 0;
}

int f[MAXN][MAXN];
int f2[MAXN][MAXN];

string a, b;

int mul(int a, int b) {
    return (ll(a) * b) % MOD;
}

template <typename ... TArgs>
int mul(int x, TArgs&& ... args) {
    return mul(x, mul(std::forward<TArgs>(args)...));
}

int main() {
#ifdef PAUNSVOKNO
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(20);
    cin >> a >> b;
    int n = a.length();
    memset(f, 0, sizeof(f));
    memset(f2, 0, sizeof(f2));
    f[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= i; j++) {
            int d = i - j;
            ll ans = 0;

            if (j > 0) {
                f2[i][j] += mul(f[i - 1][j - 1], i);
                if (j > 1) f2[i][j] += mul(i, j - 1, f2[i - 1][j - 1]);
                f2[i][j] %= MOD;
            }

            if (j) ans += mul(j, f[i - 1][j - 1]);
            if (j > 1) {
                ans += mul(j, j - 1, f2[i - 1][j - 1]);
            }
            if (d) ans += mul(d, d, f[i - 1][j]);
            ans += mul(j, d, f[i - 1][j - 1]);
            f[i][j] = ans % MOD;
        }
    }

    int k = 0, c = 0;
    for (int i = 0; i < n; i++)
        if (a[i] == '1') {
            k++;
            c += (b[i] - '0');
        }

    cout << f[k][c] << "\n";
}

Submission Info

Judge Result