oj.uz

Submission #565491

# Submission time Handle Problem Language Result Execution time Memory
565491 2022-05-21T01:23:12 Z dantoh000 Two Dishes (JOI19_dishes) C++14
74 / 100
 6849 ms 451940 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000000000;
int n,m;
int a[1000005], s[1000005], p[1000005];
int b[1000005], t[1000005], q[1000005];
int pa[1000005], pb[1000005];
map<int, int> M[1000005];
struct node{
    int s,e,m,v;
    int la, lu, marked;
    node *l, *r;
    node (int _s, int _e){
        s = _s, e = _e, m = (s+e)/2;
        v = 0;
        la = lu = marked = 0;
        if (s != e){
            l = new node(s,m);
            r = new node(m+1,e);
        }
    }
    void prop(){
        if (marked){
            v = lu;
            if (s != e){
                l->lu = r->lu = lu;
                l->marked = r->marked = true;
                l->la = r->la = 0;
            }
            marked = lu = 0;
        }
        if (la){
            v += la;
            if (s != e){
                l->la += la;
                r->la += la;
            }
            la = 0;
        }

    }
    void SET(int qs, int qe, int nv){
        prop();
        if (qs == s && qe == e){
            marked = true;
            lu = nv;
            la = 0;
            return;
        }
        if (qs > m) r->SET(qs,qe,nv);
        else if (qe <= m) l->SET(qs,qe,nv);
        else{
            l->SET(qs,m,nv);
            r->SET(m+1,qe,nv);
        }
        l->prop();
        r->prop();
        v = max(l->v, r->v);
    }
    void ADD(int qs, int qe, int nv){
        prop();
        if (qs == s && qe == e){
            la += nv;
            return;
        }
        if (qs > m) r->ADD(qs,qe,nv);
        else if (qe <= m) l->ADD(qs,qe,nv);
        else{
            l->ADD(qs,m,nv);
            r->ADD(m+1,qe,nv);
        }
        l->prop();
        r->prop();
        v = max(l->v, r->v);
    }
    int qu(int x){
        prop();
        if (s == e) return v;
        if (x > m) return r->qu(x);
        else return l->qu(x);
    }
    int fin(int x){
        prop();
        //printf("finding first element > %d, cur %d %d\n",x,s,e);
        if (s == e) {
            if (v <= x) return e+1;
            else return e;
        }
        l->prop();
        r->prop();
        if (l->v > x) return l->fin(x);
        else return r->fin(x);
    }
} *root;


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];
    }
    for (int i = 1; i <= m; i++){
        scanf("%lld%lld%lld",&b[i],&t[i],&q[i]);
        pb[i] = pb[i-1] + b[i];
    }

    for (int i = 1; i <= n; i++){
        int Ta = upper_bound(pb, pb+m+1, s[i]-pa[i])-pb-1;
        //printf("A row %d needs col <= %d\n",i,Ta);
        if (Ta != -1) {
            M[i][0] += p[i];
            if (Ta+1 <= m) M[i][Ta+1] -= p[i];
            //printf("%d %d +%d\n",i,0,p[i]);
            //printf("%d %d -%d\n",i,Ta+1,p[i]);
        }

    }
    for (int i = 1; i <= m; i++){
        int Tb = upper_bound(pa, pa+n+1, t[i]-pb[i])-pa-1;
        //printf("B col %d needs row <= %d\n",i,Tb);
        if (Tb != -1) {
            M[Tb+1][i] += q[i];
            //printf("%d %d +%d\n",Tb+1,i,q[i]);
        }

    }
    root = new node(0, m);
    int ans = 0;
    for (int i = 0; i <= n+1; i++){
        //printf("at %d\n",i);
        for (auto it = M[i].begin(); it != M[i].end(); it++){
            int id, v;
            tie(id,v) = *it;
            //printf("updating %d %d %d\n",id,m,v);
            root->ADD(id, m, v);
        }

        /*for (int i = 0; i <= m; i++){
            printf("%d ",root->qu(i));
        }
        printf("\n");*/
        for (auto it = M[i].begin(); it != M[i].end(); it++){
            int id, v;
            tie(id,v) = *it;
            int mx = -INF;
            if (id && v < 0) {
                int val = root->qu(id-1);
                if (val <= mx) continue;
                int id2 = root->fin(val)-1;
                //printf("id1 = %d, id2 = %d, setting to %d\n",id,id2,val);
                if (id2 < id) continue;
                root->SET(id, id2, val);
                mx = val;
            }
        }

        /*
        for (int i = 0; i <= m; i++){
            printf("%d ",root->qu(i));
        }
        printf("\n");*/

    }
    printf("%lld\n",root->qu(m));



}

Compilation message

dishes.cpp:98:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   98 | main(){
      | ^~~~
dishes.cpp: In function 'int main()':
dishes.cpp:130:9: warning: unused variable 'ans' [-Wunused-variable]
  130 |     int ans = 0;
      |         ^~~
dishes.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |     scanf("%lld%lld",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
dishes.cpp:101:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         scanf("%lld%lld%lld",&a[i],&s[i],&p[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         scanf("%lld%lld%lld",&b[i],&t[i],&q[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 117564 KB Output is correct
2 Correct 478 ms 119240 KB Output is correct
3 Correct 319 ms 116080 KB Output is correct
4 Correct 293 ms 106444 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 372 ms 115788 KB Output is correct
7 Correct 267 ms 96112 KB Output is correct
8 Correct 108 ms 66028 KB Output is correct
9 Correct 342 ms 116168 KB Output is correct
10 Correct 329 ms 116144 KB Output is correct
11 Correct 296 ms 116192 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 25 ms 47192 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47264 KB Output is correct
7 Correct 23 ms 47316 KB Output is correct
8 Correct 22 ms 47316 KB Output is correct
9 Correct 24 ms 47208 KB Output is correct
10 Correct 24 ms 47304 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 23 ms 47296 KB Output is correct
13 Correct 24 ms 47228 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47292 KB Output is correct
16 Correct 22 ms 47328 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 25 ms 47192 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47264 KB Output is correct
7 Correct 23 ms 47316 KB Output is correct
8 Correct 22 ms 47316 KB Output is correct
9 Correct 24 ms 47208 KB Output is correct
10 Correct 24 ms 47304 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 23 ms 47296 KB Output is correct
13 Correct 24 ms 47228 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47292 KB Output is correct
16 Correct 22 ms 47328 KB Output is correct
17 Correct 26 ms 48060 KB Output is correct
18 Correct 24 ms 47928 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 34 ms 47836 KB Output is correct
21 Correct 30 ms 48004 KB Output is correct
22 Correct 30 ms 48032 KB Output is correct
23 Correct 31 ms 48144 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 25 ms 47192 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47264 KB Output is correct
7 Correct 23 ms 47316 KB Output is correct
8 Correct 22 ms 47316 KB Output is correct
9 Correct 24 ms 47208 KB Output is correct
10 Correct 24 ms 47304 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 23 ms 47296 KB Output is correct
13 Correct 24 ms 47228 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47292 KB Output is correct
16 Correct 22 ms 47328 KB Output is correct
17 Correct 26 ms 48060 KB Output is correct
18 Correct 24 ms 47928 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 34 ms 47836 KB Output is correct
21 Correct 30 ms 48004 KB Output is correct
22 Correct 30 ms 48032 KB Output is correct
23 Correct 31 ms 48144 KB Output is correct
24 Correct 499 ms 122596 KB Output is correct
25 Correct 312 ms 110156 KB Output is correct
26 Correct 473 ms 122488 KB Output is correct
27 Correct 294 ms 110192 KB Output is correct
28 Correct 458 ms 116340 KB Output is correct
29 Correct 321 ms 116296 KB Output is correct
30 Correct 950 ms 127856 KB Output is correct
31 Correct 205 ms 97624 KB Output is correct
32 Correct 117 ms 72472 KB Output is correct
33 Correct 534 ms 109612 KB Output is correct
34 Correct 745 ms 123760 KB Output is correct
35 Correct 927 ms 128360 KB Output is correct
36 Correct 880 ms 127408 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 25 ms 47192 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47264 KB Output is correct
7 Correct 23 ms 47316 KB Output is correct
8 Correct 22 ms 47316 KB Output is correct
9 Correct 24 ms 47208 KB Output is correct
10 Correct 24 ms 47304 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 23 ms 47296 KB Output is correct
13 Correct 24 ms 47228 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47292 KB Output is correct
16 Correct 22 ms 47328 KB Output is correct
17 Correct 26 ms 48060 KB Output is correct
18 Correct 24 ms 47928 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 34 ms 47836 KB Output is correct
21 Correct 30 ms 48004 KB Output is correct
22 Correct 30 ms 48032 KB Output is correct
23 Correct 31 ms 48144 KB Output is correct
24 Correct 499 ms 122596 KB Output is correct
25 Correct 312 ms 110156 KB Output is correct
26 Correct 473 ms 122488 KB Output is correct
27 Correct 294 ms 110192 KB Output is correct
28 Correct 458 ms 116340 KB Output is correct
29 Correct 321 ms 116296 KB Output is correct
30 Correct 950 ms 127856 KB Output is correct
31 Correct 205 ms 97624 KB Output is correct
32 Correct 117 ms 72472 KB Output is correct
33 Correct 534 ms 109612 KB Output is correct
34 Correct 745 ms 123760 KB Output is correct
35 Correct 927 ms 128360 KB Output is correct
36 Correct 880 ms 127408 KB Output is correct
37 Correct 494 ms 122580 KB Output is correct
38 Correct 338 ms 110064 KB Output is correct
39 Correct 327 ms 116212 KB Output is correct
40 Correct 471 ms 116320 KB Output is correct
41 Correct 21 ms 47316 KB Output is correct
42 Correct 938 ms 127868 KB Output is correct
43 Correct 558 ms 109544 KB Output is correct
44 Correct 744 ms 123100 KB Output is correct
45 Correct 957 ms 128340 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB Output is correct
2 Correct 25 ms 47192 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 23 ms 47316 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 23 ms 47264 KB Output is correct
7 Correct 23 ms 47316 KB Output is correct
8 Correct 22 ms 47316 KB Output is correct
9 Correct 24 ms 47208 KB Output is correct
10 Correct 24 ms 47304 KB Output is correct
11 Correct 28 ms 47336 KB Output is correct
12 Correct 23 ms 47296 KB Output is correct
13 Correct 24 ms 47228 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47292 KB Output is correct
16 Correct 22 ms 47328 KB Output is correct
17 Correct 26 ms 48060 KB Output is correct
18 Correct 24 ms 47928 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 34 ms 47836 KB Output is correct
21 Correct 30 ms 48004 KB Output is correct
22 Correct 30 ms 48032 KB Output is correct
23 Correct 31 ms 48144 KB Output is correct
24 Correct 499 ms 122596 KB Output is correct
25 Correct 312 ms 110156 KB Output is correct
26 Correct 473 ms 122488 KB Output is correct
27 Correct 294 ms 110192 KB Output is correct
28 Correct 458 ms 116340 KB Output is correct
29 Correct 321 ms 116296 KB Output is correct
30 Correct 950 ms 127856 KB Output is correct
31 Correct 205 ms 97624 KB Output is correct
32 Correct 117 ms 72472 KB Output is correct
33 Correct 534 ms 109612 KB Output is correct
34 Correct 745 ms 123760 KB Output is correct
35 Correct 927 ms 128360 KB Output is correct
36 Correct 880 ms 127408 KB Output is correct
37 Correct 494 ms 122580 KB Output is correct
38 Correct 338 ms 110064 KB Output is correct
39 Correct 327 ms 116212 KB Output is correct
40 Correct 471 ms 116320 KB Output is correct
41 Correct 21 ms 47316 KB Output is correct
42 Correct 938 ms 127868 KB Output is correct
43 Correct 558 ms 109544 KB Output is correct
44 Correct 744 ms 123100 KB Output is correct
45 Correct 957 ms 128340 KB Output is correct
46 Correct 2425 ms 423248 KB Output is correct
47 Correct 1471 ms 360500 KB Output is correct
48 Correct 1491 ms 391812 KB Output is correct
49 Correct 2360 ms 391796 KB Output is correct
50 Correct 6849 ms 451940 KB Output is correct
51 Correct 3805 ms 354280 KB Output is correct
52 Correct 4463 ms 402484 KB Output is correct
53 Correct 6397 ms 447128 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 117564 KB Output is correct
2 Correct 478 ms 119240 KB Output is correct
3 Correct 319 ms 116080 KB Output is correct
4 Correct 293 ms 106444 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 372 ms 115788 KB Output is correct
7 Correct 267 ms 96112 KB Output is correct
8 Correct 108 ms 66028 KB Output is correct
9 Correct 342 ms 116168 KB Output is correct
10 Correct 329 ms 116144 KB Output is correct
11 Correct 296 ms 116192 KB Output is correct
12 Correct 22 ms 47316 KB Output is correct
13 Correct 25 ms 47192 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47316 KB Output is correct
16 Correct 22 ms 47316 KB Output is correct
17 Correct 23 ms 47264 KB Output is correct
18 Correct 23 ms 47316 KB Output is correct
19 Correct 22 ms 47316 KB Output is correct
20 Correct 24 ms 47208 KB Output is correct
21 Correct 24 ms 47304 KB Output is correct
22 Correct 28 ms 47336 KB Output is correct
23 Correct 23 ms 47296 KB Output is correct
24 Correct 24 ms 47228 KB Output is correct
25 Correct 23 ms 47316 KB Output is correct
26 Correct 23 ms 47292 KB Output is correct
27 Correct 22 ms 47328 KB Output is correct
28 Correct 26 ms 48060 KB Output is correct
29 Correct 24 ms 47928 KB Output is correct
30 Correct 28 ms 48108 KB Output is correct
31 Correct 34 ms 47836 KB Output is correct
32 Correct 30 ms 48004 KB Output is correct
33 Correct 30 ms 48032 KB Output is correct
34 Correct 31 ms 48144 KB Output is correct
35 Correct 499 ms 122596 KB Output is correct
36 Correct 312 ms 110156 KB Output is correct
37 Correct 473 ms 122488 KB Output is correct
38 Correct 294 ms 110192 KB Output is correct
39 Correct 458 ms 116340 KB Output is correct
40 Correct 321 ms 116296 KB Output is correct
41 Correct 950 ms 127856 KB Output is correct
42 Correct 205 ms 97624 KB Output is correct
43 Correct 117 ms 72472 KB Output is correct
44 Correct 534 ms 109612 KB Output is correct
45 Correct 745 ms 123760 KB Output is correct
46 Correct 927 ms 128360 KB Output is correct
47 Correct 880 ms 127408 KB Output is correct
48 Correct 494 ms 122580 KB Output is correct
49 Correct 338 ms 110064 KB Output is correct
50 Correct 327 ms 116212 KB Output is correct
51 Correct 471 ms 116320 KB Output is correct
52 Correct 21 ms 47316 KB Output is correct
53 Correct 938 ms 127868 KB Output is correct
54 Correct 558 ms 109544 KB Output is correct
55 Correct 744 ms 123100 KB Output is correct
56 Correct 957 ms 128340 KB Output is correct
57 Incorrect 420 ms 122488 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 117564 KB Output is correct
2 Correct 478 ms 119240 KB Output is correct
3 Correct 319 ms 116080 KB Output is correct
4 Correct 293 ms 106444 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 372 ms 115788 KB Output is correct
7 Correct 267 ms 96112 KB Output is correct
8 Correct 108 ms 66028 KB Output is correct
9 Correct 342 ms 116168 KB Output is correct
10 Correct 329 ms 116144 KB Output is correct
11 Correct 296 ms 116192 KB Output is correct
12 Correct 22 ms 47316 KB Output is correct
13 Correct 25 ms 47192 KB Output is correct
14 Correct 23 ms 47316 KB Output is correct
15 Correct 23 ms 47316 KB Output is correct
16 Correct 22 ms 47316 KB Output is correct
17 Correct 23 ms 47264 KB Output is correct
18 Correct 23 ms 47316 KB Output is correct
19 Correct 22 ms 47316 KB Output is correct
20 Correct 24 ms 47208 KB Output is correct
21 Correct 24 ms 47304 KB Output is correct
22 Correct 28 ms 47336 KB Output is correct
23 Correct 23 ms 47296 KB Output is correct
24 Correct 24 ms 47228 KB Output is correct
25 Correct 23 ms 47316 KB Output is correct
26 Correct 23 ms 47292 KB Output is correct
27 Correct 22 ms 47328 KB Output is correct
28 Correct 26 ms 48060 KB Output is correct
29 Correct 24 ms 47928 KB Output is correct
30 Correct 28 ms 48108 KB Output is correct
31 Correct 34 ms 47836 KB Output is correct
32 Correct 30 ms 48004 KB Output is correct
33 Correct 30 ms 48032 KB Output is correct
34 Correct 31 ms 48144 KB Output is correct
35 Correct 499 ms 122596 KB Output is correct
36 Correct 312 ms 110156 KB Output is correct
37 Correct 473 ms 122488 KB Output is correct
38 Correct 294 ms 110192 KB Output is correct
39 Correct 458 ms 116340 KB Output is correct
40 Correct 321 ms 116296 KB Output is correct
41 Correct 950 ms 127856 KB Output is correct
42 Correct 205 ms 97624 KB Output is correct
43 Correct 117 ms 72472 KB Output is correct
44 Correct 534 ms 109612 KB Output is correct
45 Correct 745 ms 123760 KB Output is correct
46 Correct 927 ms 128360 KB Output is correct
47 Correct 880 ms 127408 KB Output is correct
48 Correct 494 ms 122580 KB Output is correct
49 Correct 338 ms 110064 KB Output is correct
50 Correct 327 ms 116212 KB Output is correct
51 Correct 471 ms 116320 KB Output is correct
52 Correct 21 ms 47316 KB Output is correct
53 Correct 938 ms 127868 KB Output is correct
54 Correct 558 ms 109544 KB Output is correct
55 Correct 744 ms 123100 KB Output is correct
56 Correct 957 ms 128340 KB Output is correct
57 Correct 2425 ms 423248 KB Output is correct
58 Correct 1471 ms 360500 KB Output is correct
59 Correct 1491 ms 391812 KB Output is correct
60 Correct 2360 ms 391796 KB Output is correct
61 Correct 6849 ms 451940 KB Output is correct
62 Correct 3805 ms 354280 KB Output is correct
63 Correct 4463 ms 402484 KB Output is correct
64 Correct 6397 ms 447128 KB Output is correct
65 Incorrect 420 ms 122488 KB Output isn't correct
66 Halted 0 ms 0 KB -