QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#450403#8049. Equal SumsliqingyangWA 715ms995916kbC++17901b2024-06-22 11:57:032024-06-22 11:57:04

Judging History

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

  • [2024-06-22 11:57:04]
  • 评测
  • 测评结果:WA
  • 用时:715ms
  • 内存:995916kb
  • [2024-06-22 11:57:03]
  • 提交

answer

#include<iostream>
using namespace std;
const int mod=998244353;
inline void Add(int &x,int y)
{
	x+=y,x=x<mod?x:x-mod;
}
int n,m,l1[510],r1[510],l2[510],r2[510],f[510][510][1010];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>l1[i]>>r1[i];
	}
	for(int i=1;i<=m;i++)
	{
		cin>>l2[i]>>r2[i];
	}
	f[0][0][500]=1,f[0][0][501]=mod-1;
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=m;j++)
		{
			for(int k=0,v=0;k<1000;k++)
			{
				Add(f[i][j][k],v);
				if(!(v=f[i][j][k]))
				{
					continue;
				}
				if(k<=500&&i<n)
				{
					Add(f[i+1][j][k+l1[i+1]],v);
					Add(f[i+1][j][k+r1[i+1]+1],mod-v);
				}
				if(k>500&&j<m)
				{
					Add(f[i][j+1][k-r2[j+1]],v);
					Add(f[i][j+1][k-l2[j+1]+1],mod-v);
				}
			}
			if(i&&j)
			{
				cout<<f[i][j][500]<<" ";
			}
		}
		cout<<endl;
	}
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

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: 715ms
memory: 995916kb

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 7003rd numbers differ - expected: '422117583', found: '913101167'