QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#733837#8049. Equal Sumsucup-team4479TL 1ms5676kbC++231.4kb2024-11-10 21:28:552024-11-10 21:28:56

Judging History

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

  • [2024-11-10 21:28:56]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:5676kb
  • [2024-11-10 21:28:55]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
constexpr int N=505,M=500;
constexpr int MOD=1000000007;
int n,m;
int la[N],ra[N],lb[N],rb[N]; 
int pool[N][N][M+M],*f[N][N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    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<=n;i++)
        for(int j=0;j<=m;j++)
            f[i][j]=&pool[i][j][M];
    f[0][0][0]=1;
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)
            for(int k=-M;k<=M;k++)
                if(f[i][j][k])
                {
                    if(k>0)
                    {
                        if(j+1<=m)
                        {
                        for(int d=lb[j+1];d<=rb[j+1];d++)
                            f[i][j+1][k-d]=(f[i][j+1][k-d]+f[i][j][k])%MOD;
                        }
                    }
                    else
                    {
                        if(i+1<=n)
                        {
                            for(int d=la[i+1];d<=ra[i+1];d++)
                                f[i+1][j][k+d]=(f[i+1][j][k+d]+f[i][j][k])%MOD;
                        }
                    }
                }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            cout<<f[i][j][0]<<" ";
        cout<<"\n";
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5676kb

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:


result: