QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #479657 | #8049. Equal Sums | bai_hong | WA | 1293ms | 991252kb | C++14 | 1.1kb | 2024-07-15 19:54:11 | 2024-07-15 19:54:11 |
Judging History
answer
#include<bits/stdc++.h>
const int mod=988244353;
using namespace std;
inline int read(){
int x=0,f=1; char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar())
if (ch=='-') f=-1;
for (;ch>='0'&&ch<='9';ch=getchar())
x=(x<<1)+(x<<3)+(ch^48);
return x*f;
}
int n,m,lx[505],rx[505],ly[505],ry[505],f[505][505][1005];
inline int plu(const int &x){ return x>=mod ? x-mod:x; }
signed main(){
n=read(),m=read();
for (int i=1;i<=n;i++)
lx[i]=read(),rx[i]=read();
for (int i=1;i<=m;i++)
ly[i]=read(),ry[i]=read();
for (int i=500;i<=1000;i++) f[0][0][i]=1;
for (int i=0;i<=n;i++)
for (int j=0;j<=m;j++)
for (int k=1;k<=1000;k++){
if (!i&&!j) continue;
if (i&&!(k-lx[i]<1||k-rx[i]>500))
f[i][j][k]=plu(f[i][j][k]+plu(f[i-1][j][min(500,k-lx[i])]-f[i-1][j][max(1,k-rx[i])-1]+mod));
if (j&&!(k+ly[j]>1000||k+ry[j]<=500))
f[i][j][k]=plu(f[i][j][k]+plu(f[i][j-1][min(1000,k+ry[j])]-f[i][j-1][max(501,k+ly[j])-1]+mod));
f[i][j][k]=plu(f[i][j][k]+f[i][j][k-1]);
}
for (int i=1;i<=n;i++,puts("")) for (int j=1;j<=m;j++)
printf("%d ",plu(f[i][j][500]-f[i][j][499]+mod));
return 0;
}
/*
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4008kb
input:
2 3 1 2 2 3 1 4 2 2 1 3
output:
2 0 0 3 4 4
result:
ok 6 numbers
Test #2:
score: -100
Wrong Answer
time: 1293ms
memory: 991252kb
input:
500 500 19 458 1 480 7 485 50 461 12 476 15 461 48 466 40 453 46 467 9 458 27 478 26 472 46 459 29 490 6 500 17 487 48 484 28 472 28 459 25 480 4 491 29 481 36 460 2 491 44 499 22 473 20 458 4 483 27 471 2 496 11 461 43 450 2 478 37 466 15 459 42 482 7 451 19 455 2 453 47 475 48 450 1 474 46 471 9 4...
output:
411 79401 9145270 673005095 520581065 425290882 377246388 301976396 82015382 435132318 243710128 859521808 901928982 915264051 974047211 432125407 128446195 768325491 177100 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
wrong answer 5th numbers differ - expected: '180581065', found: '520581065'