oj.uz

Submission #563963

# Submission time Handle Problem Language Result Execution time Memory
563963 2022-05-18T10:05:17 Z dantoh000 Two Dishes (JOI19_dishes) C++14
10 / 100
 191 ms 32156 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000000000;
int n,m;
int a[200005], s[200005], p[200005];
int b[200005], t[200005], q[200005];
int pa[200005];
int pb[200005];
int pp[200005], pq[200005];
int mem[2005][2005];
int dp(int i, int j){
    if (i == n+1 && j == m+1) return 0;
    if (mem[i][j] != -1) return mem[i][j];
    int T = pa[i-1] + pb[j-1];
    int ret = -INF;
    if (i != n+1){
        ret = max(ret, dp(i+1, j) + ((T+a[i] <= s[i])?p[i]:0));
    }
    if (j != m+1){
        ret = max(ret, dp(i, j+1) + ((T+b[j] <= t[j])?q[j]:0));
    }
    //printf("%d %d %d %d\n",i,j,T,ret);
    return mem[i][j] = ret;
}
main(){
    scanf("%lld%lld",&n,&m);
    for (int i = 1; i <= n; i++){
        scanf("%lld%lld%lld",&a[i],&s[i],&p[i]);
        pa[i] = pa[i-1] + a[i];
        pp[i] = pp[i-1] + p[i];
    }
    for (int i = 1; i <= m; i++){
        scanf("%lld%lld%lld",&b[i],&t[i],&q[i]);
        pb[i] = pb[i-1] + b[i];
        pq[i] = pq[i-1] + q[i];
    }
    if (n <= 2000 && m <= 2000){
        memset(mem,-1,sizeof(mem));
        printf("%lld",dp(1,1));
    }
    else{
        if (s[0] > t[0]){
            swap(n,m);
            swap(a,b);
            swap(s,t);
            swap(p,q);
            swap(pp,pq);
            swap(pa,pb);
        }
        int ans = -INF;
        int R = m;
        int curT = 0;
        int stopT = 0;
        for (int i = 1; i <= n; i++){
            if (pa[i] <= s[1]) pp[i] = max(pp[i-1], pp[i]);
            else pp[i] = pp[i-1];
        }
        for (int i = 0; i <= n; i++){
            while (pa[i] + pb[R] > t[1]){
                R--;
            }
            ans = max(ans, pp[i]+pq[R]);
        }
        printf("%lld",ans);

    }
}

Compilation message

dishes.cpp:26:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 | main(){
      | ^~~~
dishes.cpp: In function 'int main()':
dishes.cpp:53:13: warning: unused variable 'curT' [-Wunused-variable]
   53 |         int curT = 0;
      |             ^~~~
dishes.cpp:54:13: warning: unused variable 'stopT' [-Wunused-variable]
   54 |         int stopT = 0;
      |             ^~~~~
dishes.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%lld%lld",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%lld%lld%lld",&a[i],&s[i],&p[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         scanf("%lld%lld%lld",&b[i],&t[i],&q[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 191 ms 32108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31752 KB Output is correct
3 Correct 13 ms 31752 KB Output is correct
4 Correct 15 ms 31768 KB Output is correct
5 Correct 17 ms 31744 KB Output is correct
6 Correct 14 ms 31828 KB Output is correct
7 Correct 13 ms 31772 KB Output is correct
8 Correct 15 ms 31784 KB Output is correct
9 Correct 13 ms 31836 KB Output is correct
10 Correct 16 ms 31828 KB Output is correct
11 Correct 14 ms 31828 KB Output is correct
12 Correct 13 ms 31956 KB Output is correct
13 Correct 15 ms 31700 KB Output is correct
14 Correct 13 ms 31740 KB Output is correct
15 Correct 13 ms 31832 KB Output is correct
16 Correct 19 ms 31828 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31752 KB Output is correct
3 Correct 13 ms 31752 KB Output is correct
4 Correct 15 ms 31768 KB Output is correct
5 Correct 17 ms 31744 KB Output is correct
6 Correct 14 ms 31828 KB Output is correct
7 Correct 13 ms 31772 KB Output is correct
8 Correct 15 ms 31784 KB Output is correct
9 Correct 13 ms 31836 KB Output is correct
10 Correct 16 ms 31828 KB Output is correct
11 Correct 14 ms 31828 KB Output is correct
12 Correct 13 ms 31956 KB Output is correct
13 Correct 15 ms 31700 KB Output is correct
14 Correct 13 ms 31740 KB Output is correct
15 Correct 13 ms 31832 KB Output is correct
16 Correct 19 ms 31828 KB Output is correct
17 Correct 68 ms 32156 KB Output is correct
18 Correct 61 ms 32152 KB Output is correct
19 Correct 62 ms 32152 KB Output is correct
20 Correct 61 ms 32072 KB Output is correct
21 Correct 67 ms 32156 KB Output is correct
22 Correct 63 ms 32156 KB Output is correct
23 Correct 74 ms 32156 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31752 KB Output is correct
3 Correct 13 ms 31752 KB Output is correct
4 Correct 15 ms 31768 KB Output is correct
5 Correct 17 ms 31744 KB Output is correct
6 Correct 14 ms 31828 KB Output is correct
7 Correct 13 ms 31772 KB Output is correct
8 Correct 15 ms 31784 KB Output is correct
9 Correct 13 ms 31836 KB Output is correct
10 Correct 16 ms 31828 KB Output is correct
11 Correct 14 ms 31828 KB Output is correct
12 Correct 13 ms 31956 KB Output is correct
13 Correct 15 ms 31700 KB Output is correct
14 Correct 13 ms 31740 KB Output is correct
15 Correct 13 ms 31832 KB Output is correct
16 Correct 19 ms 31828 KB Output is correct
17 Correct 68 ms 32156 KB Output is correct
18 Correct 61 ms 32152 KB Output is correct
19 Correct 62 ms 32152 KB Output is correct
20 Correct 61 ms 32072 KB Output is correct
21 Correct 67 ms 32156 KB Output is correct
22 Correct 63 ms 32156 KB Output is correct
23 Correct 74 ms 32156 KB Output is correct
24 Incorrect 136 ms 15840 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31752 KB Output is correct
3 Correct 13 ms 31752 KB Output is correct
4 Correct 15 ms 31768 KB Output is correct
5 Correct 17 ms 31744 KB Output is correct
6 Correct 14 ms 31828 KB Output is correct
7 Correct 13 ms 31772 KB Output is correct
8 Correct 15 ms 31784 KB Output is correct
9 Correct 13 ms 31836 KB Output is correct
10 Correct 16 ms 31828 KB Output is correct
11 Correct 14 ms 31828 KB Output is correct
12 Correct 13 ms 31956 KB Output is correct
13 Correct 15 ms 31700 KB Output is correct
14 Correct 13 ms 31740 KB Output is correct
15 Correct 13 ms 31832 KB Output is correct
16 Correct 19 ms 31828 KB Output is correct
17 Correct 68 ms 32156 KB Output is correct
18 Correct 61 ms 32152 KB Output is correct
19 Correct 62 ms 32152 KB Output is correct
20 Correct 61 ms 32072 KB Output is correct
21 Correct 67 ms 32156 KB Output is correct
22 Correct 63 ms 32156 KB Output is correct
23 Correct 74 ms 32156 KB Output is correct
24 Incorrect 136 ms 15840 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31752 KB Output is correct
3 Correct 13 ms 31752 KB Output is correct
4 Correct 15 ms 31768 KB Output is correct
5 Correct 17 ms 31744 KB Output is correct
6 Correct 14 ms 31828 KB Output is correct
7 Correct 13 ms 31772 KB Output is correct
8 Correct 15 ms 31784 KB Output is correct
9 Correct 13 ms 31836 KB Output is correct
10 Correct 16 ms 31828 KB Output is correct
11 Correct 14 ms 31828 KB Output is correct
12 Correct 13 ms 31956 KB Output is correct
13 Correct 15 ms 31700 KB Output is correct
14 Correct 13 ms 31740 KB Output is correct
15 Correct 13 ms 31832 KB Output is correct
16 Correct 19 ms 31828 KB Output is correct
17 Correct 68 ms 32156 KB Output is correct
18 Correct 61 ms 32152 KB Output is correct
19 Correct 62 ms 32152 KB Output is correct
20 Correct 61 ms 32072 KB Output is correct
21 Correct 67 ms 32156 KB Output is correct
22 Correct 63 ms 32156 KB Output is correct
23 Correct 74 ms 32156 KB Output is correct
24 Incorrect 136 ms 15840 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 191 ms 32108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 191 ms 32108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -