84ptsWA求调 悬赏一关

#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=505,mod=998244353;
int n,m,pri[N],fac[N]={0,1},f[N][N][N],ans;
string s;
void solve(){
	cin>>n>>m>>s;
	for(int i=1,c;i<=n;i++) cin>>c,pri[c]++;
	for(int i=1;i<=n;i++) pri[i]+=pri[i-1];
	for(int i=2;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
	f[0][0][0]=1;
	for(int i=0;i<n;i++) for(int j=0;j<=i;j++) for(int k=0;k<=i;k++){
		if(s[i]=='0') f[i+1][j+1][k]=(f[i+1][j+1][k]+f[i][j][k])%mod;
		else{
			f[i+1][j][k]=(f[i+1][j][k]+f[i][j][k])%mod;
			f[i+1][j][k+1]=(f[i+1][j][k+1]-1ll*f[i][j][k]*(pri[j]-k)%mod)%mod;
			f[i+1][j+1][k+1]=(1ll*f[i][j][k]*(pri[j]-k)%mod)%mod;
		}
	}
	for(int i=0;i<=n-m;i++)
		for(int j=0;j<=n;j++)
			ans=(ans+1ll*f[n][i][j]*fac[n-j]%mod)%mod;
	cout<<(ans+mod)%mod;
}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	solve();
	return 0;
}