oj.uz

Submission #375817

# Submission time Handle Problem Language Result Execution time Memory
375817 2021-03-10T02:59:38 Z daniel920712 Two Dishes (JOI19_dishes) C++14
15 / 100
 196 ms 36224 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;
long long all1[1000005],Time1[1000005],how1[1000005];
long long all2[1000005],Time2[1000005],how2[1000005];
long long pre1[1000005]={0};
long long pre2[1000005]={0};

long long score1[1000005]={0};
long long score2[1000005]={0};
bool have[2005][2005];
long long DP[2005][2005]={0};
long long N,M;
long long F(long long x,long long y)
{
    long long a=0,b=0;
    if(x==N&&y==M) return 0;
    if(have[x][y]) return DP[x][y];
    have[x][y]=1;
    if(x==N)
    {
        DP[x][y]=F(x,y+1);
        if((pre1[x]+pre2[y+1])<=Time2[y]) DP[x][y]+=how2[y];
    }
    else if(y==M)
    {
        DP[x][y]=F(x+1,y);
        if((pre1[x+1]+pre2[y])<=Time1[x]) DP[x][y]+=how1[x];
    }
    else
    {
        a=F(x,y+1);
        if((pre1[x]+pre2[y+1])<=Time2[y]) a+=how2[y];
        b=F(x+1,y);
        if((pre1[x+1]+pre2[y])<=Time1[x]) b+=how1[x];
        DP[x][y]=max(a,b);
    }
    return DP[x][y];
}
int main()
{
    long long ans=-1e18,i;
    scanf("%lld %lld",&N,&M);
    for(i=0;i<N;i++)
    {
        scanf("%lld %lld %lld",&all1[i],&Time1[i],&how1[i]);
        pre1[i+1]=pre1[i]+all1[i];
        score1[i+1]=score1[i]+how1[i];
    }
    for(i=0;i<M;i++)
    {
        scanf("%lld %lld %lld",&all2[i],&Time2[i],&how2[i]);
        pre2[i+1]=pre2[i]+all2[i];
        score2[i+1]=score2[i]+how2[i];
    }
    if(N<=2000&&M<=2000) printf("%lld\n",F(0,0));
    else
    {
        for(i=0;i<=N;i++)
        {
            if(pre1[i]<=Time1[0])
            {
                ans=max(ans,score1[i]+score2[upper_bound(pre2,pre2+M+1,Time1[0]-pre1[i])-pre2-1]);
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
dishes.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |         scanf("%lld %lld %lld",&all1[i],&Time1[i],&how1[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |         scanf("%lld %lld %lld",&all2[i],&Time2[i],&how2[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 16108 KB Output is correct
2 Correct 196 ms 15852 KB Output is correct
3 Correct 180 ms 16108 KB Output is correct
4 Correct 170 ms 15852 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 169 ms 15436 KB Output is correct
7 Correct 83 ms 8172 KB Output is correct
8 Correct 94 ms 8300 KB Output is correct
9 Correct 182 ms 16108 KB Output is correct
10 Correct 161 ms 16116 KB Output is correct
11 Correct 157 ms 16060 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 182 ms 36204 KB Output is correct
18 Correct 189 ms 36204 KB Output is correct
19 Correct 189 ms 36224 KB Output is correct
20 Correct 168 ms 36204 KB Output is correct
21 Correct 171 ms 34796 KB Output is correct
22 Correct 182 ms 36204 KB Output is correct
23 Correct 184 ms 36204 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 182 ms 36204 KB Output is correct
18 Correct 189 ms 36204 KB Output is correct
19 Correct 189 ms 36224 KB Output is correct
20 Correct 168 ms 36204 KB Output is correct
21 Correct 171 ms 34796 KB Output is correct
22 Correct 182 ms 36204 KB Output is correct
23 Correct 184 ms 36204 KB Output is correct
24 Incorrect 154 ms 16108 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 182 ms 36204 KB Output is correct
18 Correct 189 ms 36204 KB Output is correct
19 Correct 189 ms 36224 KB Output is correct
20 Correct 168 ms 36204 KB Output is correct
21 Correct 171 ms 34796 KB Output is correct
22 Correct 182 ms 36204 KB Output is correct
23 Correct 184 ms 36204 KB Output is correct
24 Incorrect 154 ms 16108 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 182 ms 36204 KB Output is correct
18 Correct 189 ms 36204 KB Output is correct
19 Correct 189 ms 36224 KB Output is correct
20 Correct 168 ms 36204 KB Output is correct
21 Correct 171 ms 34796 KB Output is correct
22 Correct 182 ms 36204 KB Output is correct
23 Correct 184 ms 36204 KB Output is correct
24 Incorrect 154 ms 16108 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 16108 KB Output is correct
2 Correct 196 ms 15852 KB Output is correct
3 Correct 180 ms 16108 KB Output is correct
4 Correct 170 ms 15852 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 169 ms 15436 KB Output is correct
7 Correct 83 ms 8172 KB Output is correct
8 Correct 94 ms 8300 KB Output is correct
9 Correct 182 ms 16108 KB Output is correct
10 Correct 161 ms 16116 KB Output is correct
11 Correct 157 ms 16060 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 452 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 182 ms 36204 KB Output is correct
29 Correct 189 ms 36204 KB Output is correct
30 Correct 189 ms 36224 KB Output is correct
31 Correct 168 ms 36204 KB Output is correct
32 Correct 171 ms 34796 KB Output is correct
33 Correct 182 ms 36204 KB Output is correct
34 Correct 184 ms 36204 KB Output is correct
35 Incorrect 154 ms 16108 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 16108 KB Output is correct
2 Correct 196 ms 15852 KB Output is correct
3 Correct 180 ms 16108 KB Output is correct
4 Correct 170 ms 15852 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 169 ms 15436 KB Output is correct
7 Correct 83 ms 8172 KB Output is correct
8 Correct 94 ms 8300 KB Output is correct
9 Correct 182 ms 16108 KB Output is correct
10 Correct 161 ms 16116 KB Output is correct
11 Correct 157 ms 16060 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 452 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 182 ms 36204 KB Output is correct
29 Correct 189 ms 36204 KB Output is correct
30 Correct 189 ms 36224 KB Output is correct
31 Correct 168 ms 36204 KB Output is correct
32 Correct 171 ms 34796 KB Output is correct
33 Correct 182 ms 36204 KB Output is correct
34 Correct 184 ms 36204 KB Output is correct
35 Incorrect 154 ms 16108 KB Output isn't correct
36 Halted 0 ms 0 KB -