QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#764261#8049. Equal Sumszero-rangeWA 1640ms993908kbC++23740b2024-11-20 08:21:322024-11-20 08:21:33

Judging History

你现在查看的是最新测评结果

  • [2024-11-20 08:21:33]
  • 评测
  • 测评结果:WA
  • 用时:1640ms
  • 内存:993908kb
  • [2024-11-20 08:21:32]
  • 提交

answer

#include<stdio.h>
#define M 505
constexpr int mod=998244353;
int n,m,f[M][M][M<<1],a[M],b[M],c[M],d[M];
int main(){
	// freopen("in.txt","r",stdin);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i) scanf("%d%d",a+i,b+i);
	for(int i=1;i<=m;++i) scanf("%d%d",c+i,d+i);
	f[0][0][M]=1,f[0][0][M+1]=mod-1;
	for(int i=0;i<=n;++i) for(int j=0;j<=m;++j){
		for(int k=1;k<M*2;++k) (f[i][j][k]+=f[i][j][k-1])%=mod;
		for(int k=0;k<M*2;++k){
			if(k<=M&&i<n) (f[i+1][j][k+a[i+1]]+=f[i][j][k])%=mod,(f[i+1][j][k+b[i+1]+1]-=f[i][j][k])%=mod;
			if(k>M&&j<m) (f[i][j+1][k-d[j+1]]+=f[i][j][k])%=mod,(f[i][j+1][k-c[j+1]+1]-=f[i][j][k])%=mod;
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j) printf("%d ",f[i][j][M]);
		puts("");
	}
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 1660kb

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: 1640ms
memory: 993908kb

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 -817663288 984223118 -411655119 293043270 -593880557 865361724 -332756365 118838806 -72054409 226338288 -476764496 808644951 -212203065 340769021 -998067253 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 ...

result:

wrong answer 5th numbers differ - expected: '180581065', found: '-817663288'