QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#479427#8049. Equal SumsDEMONKILLERWA 1100ms11796kbC++14891b2024-07-15 17:26:092024-07-15 17:26:11

Judging History

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

  • [2024-07-15 17:26:11]
  • 评测
  • 测评结果:WA
  • 用时:1100ms
  • 内存:11796kb
  • [2024-07-15 17:26:09]
  • 提交

answer

#include<bits/stdc++.h>
#define N 510
#define V 500
#define mod 998244353
using namespace std;
int n,m,lx[N],rx[N],ly[N],ry[N],f[2][N][N<<1],s[2][N][N<<1];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%d%d",&lx[i],&rx[i]);
    for(int i=1;i<=m;i++)scanf("%d%d",&ly[i],&ry[i]);
    for(int i=V;i<=V<<1;i++)s[0][0][i]=1;
    for(int i=0;i<=n;i++){
        int x=i&1;
        for(int j=0;j<=m;j++){
            if(i)for(int k=V;k<=V<<1;k++)
                f[x][j][k]=(f[x][j][k]+s[x^1][j][k-lx[i]]-s[x^1][j][k-rx[i]-1]+mod)%mod;
            if(j)for(int k=0;k<V;k++)
                f[x][j][k]=(f[x][j][k]+s[x][j-1][k+ry[j]]-s[x][j-1][k+ly[j]-1]+mod)%mod;
            if(i||j)for(int k=0;k<=V<<1;k++)
                s[x][j][k]=(s[x][j][k-1]+f[x][j][k])%mod;
            if(i&&j)printf("%d ",f[x][j][V]);
        }
        if(i)puts("");
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 4024kb

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: 1100ms
memory: 11796kb

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 180581065 984223118 586589234 293043270 404363796 865361724 665487988 118838806 926189944 226338288 521479857 808644951 786041288 340769021 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 ...

result:

wrong answer 1001st numbers differ - expected: '13811799', found: '13812624'