QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #478364 | #8049. Equal Sums | sumi007 | WA | 2203ms | 19512kb | C++14 | 1.2kb | 2024-07-14 21:30:52 | 2024-07-14 21:30:53 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 505,mod = 998244353;
ll n,m,mx,lx[N],rx[N],ly[N],ry[N],f[2][N][2*N],s[2][N][2*N];
int main(){
cin.tie(0),cout.tie(0);
ios::sync_with_stdio(0);
cin >> n >> m;
for(int i=1;i<=n;i++) cin >> lx[i] >> rx[i],mx = max(mx,rx[i]);
for(int i=1;i<=m;i++) cin >> ly[i] >> ry[i],mx = max(mx,ry[i]);
mx = 500;
f[0][0][mx] = s[0][0][mx] = 1;
for(int i=mx;i<=2*mx;i++) s[0][0][i] = 1;
for(ll i=0;i<=n;i++){
int o = i&1;
for(ll j=0;j<=m;j++){
if(i+j==0) continue;
for(ll k=0,l,r;k<=2*mx;k++){
f[o][j][k] = 0;
if(i){
l = max(k-rx[i]-1,0ll),r = min(mx-1,k-lx[i]);
if(l<=r) f[o][j][k] += (s[o^1][j][r]-s[o^1][j][l])%mod;
}
if(j){
l = max(mx-1,k+ly[j]-1),r = min(k+ry[j],2*mx);
if(l<=r) f[o][j][k] += (s[o][j-1][r]-s[o][j-1][l])%mod;
}
f[o][j][k] = s[o][j][k] = (f[o][j][k]+2*mod)%mod;
}
for(int k=1;k<=2*mx;k++) s[o][j][k] += s[o][j][k-1],s[o][j][k] %= mod;
if(i && j) cout << f[o][j][mx] << " ";
}
cout << "\n";
}
return 0;
}
// 1 7
// 19 458
// 48 461
// 13 470
// 19 483
// 24 491
// 24 490
// 28 485
// 12 481
// 411 79401 9145270 673005095 180581065 984223118 586589234
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 9776kb
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: 2203ms
memory: 19512kb
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 2566th numbers differ - expected: '180331398', found: '559196107'