QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #782733 | #8049. Equal Sums | hhiron | WA | 1893ms | 8592kb | C++14 | 1.3kb | 2024-11-25 21:11:43 | 2024-11-25 21:11:47 |
Judging History
answer
#include<bits/stdc++.h>
#define INF 0x7fffffff
typedef long long ll;
using namespace std;
const int MOD=998244353;
const int N=1205;
int n,m,al[N],ar[N],bl[N],br[N];
int f[2][N][N],pre1[N],pre2[N];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d%d",&al[i],&ar[i]);
for(int i=1;i<=m;i++) scanf("%d%d",&bl[i],&br[i]);
f[0][0][500]=1;
for(int i=0;i<=n;i++){
int tag=i&1;
if(i) for(int j=0;j<=m;j++)
for(int v=1;v<=1000;v++) f[tag][j][v]=0;
for(int j=0;j<=m;j++){
pre1[0]=f[(tag^1)][j][0];
if(i) for(int v=1;v<=500;v++) pre1[v]=(pre1[v-1]+f[(tag^1)][j][v])%MOD;
pre2[500]=0;
if(j) for(int v=501;v<=1000;v++) pre2[v]=(pre2[v-1]+f[tag][j-1][v])%MOD;
int l=0,r=0;
if(i) for(int v=0;v<=1000;v++){
l=max(0,min(v-ar[i]-1,500)),r=max(0,min(v-al[i],500));
f[tag][j][v]=(f[tag][j][v]+pre1[r]-pre1[l]+MOD)%MOD;
}
if(j) for(int v=1000;v>=0;v--){
l=min(1000,max(v+bl[j]-1,500)),r=min(1000,max(v+br[j],500));
f[tag][j][v]=(f[tag][j][v]+pre2[r]-pre2[l]+MOD)%MOD;
}
// if(i==1&&j==1){
// for(int v=500;v<=1000;v++) cout<<pre2[v]<<" ";
// cout<<endl;
// cout<<f[tag][j][501]<<":"<<pre2[1000]<<endl;
// }
if(i&&j) printf("%lld ",f[tag][j][500]);
}if(i) printf("\n");
}
return 0;
}/*
1 1
1 1
1 1
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3968kb
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: 1893ms
memory: 8592kb
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 504th numbers differ - expected: '670493199', found: '922152033'