QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#764421 | #8049. Equal Sums | Sai_tqwq | TL | 3ms | 20740kb | C++14 | 855b | 2024-11-20 09:04:28 | 2024-11-20 09:04:40 |
Judging History
answer
#include<bits/stdc++.h>
#pragma GCC optimize("-ofast")
using namespace std;
#define endl '\n'
mt19937 rnd(537462565);
const int mod=998244353,V=505;
int n,m,la[555],ra[555],lb[555],rb[555];
unordered_map<int,int> dp[555][555];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>la[i]>>ra[i];
for(int i=1;i<=m;i++)cin>>lb[i]>>rb[i];
for(int i=0;i<=V;i++)dp[0][0][i]=1;
for(int i=0;i<=n;cout<<(i?"\n":""),i++)for(int j=0;j<=m;j++)if(i||j){
if(i)for(int p=0;p<=V;p++)(dp[i][j][p]+=(dp[i-1][j][p-la[i]]+mod-dp[i-1][j][p-ra[i]-1])%mod)%=mod;
if(j)for(int p=-V;p<0;p++)(dp[i][j][p]+=(dp[i][j-1][p+rb[j]]+mod-dp[i][j-1][p+lb[j]-1])%mod)%=mod;
if(i)dp[i-1][j].clear();
if(i&&j)cout<<dp[i][j][0]<<' ';
for(int p=-V;p<=V;p++)(dp[i][j][p]+=dp[i][j][p-1])%=mod;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 20740kb
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
Time 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 ...