QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#478321#8049. Equal Sumssumi007WA 1ms9752kbC++141.2kb2024-07-14 20:36:362024-07-14 20:36:36

Judging History

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

  • [2024-07-14 20:36:36]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:9752kb
  • [2024-07-14 20:36:36]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N = 505,mod = 998244353; 
int 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]);
	f[0][0][mx] = s[0][0][mx] = 1;
	for(int i=mx;i<=2*mx;i++) s[0][0][i] = 1;
	for(int i=0;i<=n;i++){
		int o = i&1;
		for(int j=0;j<=m;j++){
			if(i+j==0) continue;
			for(int k=0,l,r;k<=2*mx;k++){
				f[o][j][k] = 0;
				if(j){
					l = max(mx,k+ly[j]),r = min(k+ry[j],2*mx);
//					cout << i << " " << j << ' ' << k << ' ' << l << ' ' << r << "\n";
					if(l<=r) f[o][j][k] += (s[o][j-1][r]-s[o][j-1][l]+f[o][j-1][l]+mod)%mod;
				}
				if(i){
					l = max(k-ry[j],0),r = min(mx-1,k-ly[j]);
//					cout << i << " " << j << ' ' << k << ' ' << l << ' ' << r << "\n";
					if(l<=r) f[o][j][k] += (s[o^1][j][r]-s[o^1][j][l]+f[o^1][j][l]+mod)%mod;
				}
				s[o][j][k] = f[o][j][k];
			}
			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][0] << ' ';
		}
		cout << "\n";
	}
	return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 9752kb

input:

2 3
1 2
2 3
1 4
2 2
1 3

output:

1 0 0 
0 0 0 0 
0 0 0 0 

result:

wrong answer 1st numbers differ - expected: '2', found: '1'