QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #763408 | #8049. Equal Sums | Grain_Depot08 | ML | 1ms | 6004kb | C++17 | 869b | 2024-11-19 20:06:49 | 2024-11-19 20:06:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define mod 998244353
#define N 505
int n,m,f[N][N][N+N],s[N][N][N+N],a[N],b[N],x[N],y[N];
int main(){
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",&x[i],&y[i]);
x[i]=-x[i];y[i]=-y[i];
swap(x[i],y[i]);
}
f[0][0][N]=1;
for(int i=0;i<=n;++i){
for(int j=0;j<=m;++j){
for(int k=-500;k<=500;++k){
if(k>0){
if(i)f[i][j][N+k]=((f[i][j][N+k]+s[i-1][j][N+k-a[i]])%mod-s[i-1][j][N+k-b[i]-1]+mod)%mod;
}else{
if(j)f[i][j][N+k]=((f[i][j][N+k]+s[i][j-1][N+k-x[j]])%mod-s[i][j-1][N+k-y[j]-1]+mod)%mod;
}
}
for(int k=-500;k<=500;++k)
s[i][j][N+k]=(s[i][j][N+k-1]+f[i][j][N+k])%mod;
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j)
printf("%d ",f[i][j][N]);
printf("\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 6004kb
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
Memory Limit Exceeded
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 ...