没有大佬回复我吗 \qwq
by 一只书虫仔 @ 2020-03-21 21:28:35
嘤嘤嘤,我太菜了,没有大佬眷顾我 \qwq
by 一只书虫仔 @ 2020-03-21 21:33:58
@[一只书虫仔](/user/114914) 缩进问题吗?
by JasonWZJ @ 2020-03-21 21:38:04
~~马蜂极其丑陋。~~
by JasonWZJ @ 2020-03-21 21:39:47
@[JasonWZJ](/user/318037) 窝感觉马蜂很好啊
by AgrumeStly @ 2020-03-21 21:41:13
@[一只书虫仔](/user/114914) stO
by AgrumeStly @ 2020-03-21 21:41:33
@[_TNT_](/user/128369) 我一看就知道会MLE
by JasonWZJ @ 2020-03-21 21:44:53
https://www.luogu.com.cn/record/31996150
by JasonWZJ @ 2020-03-21 21:45:13
@[一只书虫仔](/user/114914)
```cpp
//骗人的代码:你抄你死定了。。。
#include<cstdio>
#include<cstring>
using namespace std;
const long long MOD=998244353;
long long a[200][3000],rs[200];
int n=0,m=0;
inline int hsh(int x){return x+n+10;}
long long dp[200][500];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
scanf("%lld",&a[i][j]);
rs[i]=(rs[i]+a[i][j])%MOD;
}
}
long long sum=1;for(int i=1;i<=n;i++)sum=(sum*(rs[i]+1))%MOD;sum=(sum+MOD-1)%MOD;
for(int j=1;j<=m;j++)
{
memset(dp,0,sizeof(dp));
dp[1][hsh(0)]=1,dp[1][hsh(1)]=a[1][j],dp[1][hsh(-1)]=(rs[1]+MOD-a[1][j])%MOD;
for(int i=2;i<=n;i++)
{
for(int k=-n;k<=n;k++)
{
dp[i][hsh(k)]=(dp[i-1][hsh(k)]+a[i][j]*dp[i-1][hsh(k-1)]%MOD+(rs[i]+MOD-a[i][j])*dp[i-1][hsh(k+1)]%MOD)%MOD;
}
}
for(int k=1;k<=n;k++)sum=(sum+MOD-dp[n][hsh(k)])%MOD;
}
printf("%lld",sum);
return 0;
}
by JasonWZJ @ 2020-03-21 21:47:20
@[JasonWZJ](/user/318037) 我知道了,老师说我要降维【汗】
by 一只书虫仔 @ 2020-03-21 21:47:57