oj.uz

Submission #565486

# Submission time Handle Problem Language Result Execution time Memory
565486 2022-05-21T00:54:03 Z dantoh000 Two Dishes (JOI19_dishes) C++14
74 / 100
 7368 ms 488824 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 = 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();
        if (s != e){
            l->prop();
            r->prop();
            v = max(l->v, r->v);
        }
        //printf("finding first element > %d, cur %d %d\n",x,s,e);
        if (s == e) {
            if (v <= x) return e+1;
            else return e;
        }
        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].rbegin(); it != M[i].rend(); 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;
            if (id) {
                int val = root->qu(id-1);
                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);
            }
        }

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

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



}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 117496 KB Output is correct
2 Correct 448 ms 119208 KB Output is correct
3 Correct 411 ms 116128 KB Output is correct
4 Correct 291 ms 106416 KB Output is correct
5 Correct 22 ms 47232 KB Output is correct
6 Correct 407 ms 115944 KB Output is correct
7 Correct 258 ms 96068 KB Output is correct
8 Correct 106 ms 66048 KB Output is correct
9 Correct 374 ms 116188 KB Output is correct
10 Correct 364 ms 116196 KB Output is correct
11 Correct 350 ms 116252 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47236 KB Output is correct
2 Correct 24 ms 47240 KB Output is correct
3 Correct 23 ms 47320 KB Output is correct
4 Correct 22 ms 47316 KB Output is correct
5 Correct 24 ms 47316 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 22 ms 47336 KB Output is correct
9 Correct 28 ms 47240 KB Output is correct
10 Correct 26 ms 47220 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 23 ms 47316 KB Output is correct
13 Correct 29 ms 47240 KB Output is correct
14 Correct 25 ms 47308 KB Output is correct
15 Correct 25 ms 47292 KB Output is correct
16 Correct 25 ms 47232 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47236 KB Output is correct
2 Correct 24 ms 47240 KB Output is correct
3 Correct 23 ms 47320 KB Output is correct
4 Correct 22 ms 47316 KB Output is correct
5 Correct 24 ms 47316 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 22 ms 47336 KB Output is correct
9 Correct 28 ms 47240 KB Output is correct
10 Correct 26 ms 47220 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 23 ms 47316 KB Output is correct
13 Correct 29 ms 47240 KB Output is correct
14 Correct 25 ms 47308 KB Output is correct
15 Correct 25 ms 47292 KB Output is correct
16 Correct 25 ms 47232 KB Output is correct
17 Correct 26 ms 48000 KB Output is correct
18 Correct 26 ms 47832 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 33 ms 47828 KB Output is correct
21 Correct 30 ms 48044 KB Output is correct
22 Correct 32 ms 48068 KB Output is correct
23 Correct 28 ms 48084 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47236 KB Output is correct
2 Correct 24 ms 47240 KB Output is correct
3 Correct 23 ms 47320 KB Output is correct
4 Correct 22 ms 47316 KB Output is correct
5 Correct 24 ms 47316 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 22 ms 47336 KB Output is correct
9 Correct 28 ms 47240 KB Output is correct
10 Correct 26 ms 47220 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 23 ms 47316 KB Output is correct
13 Correct 29 ms 47240 KB Output is correct
14 Correct 25 ms 47308 KB Output is correct
15 Correct 25 ms 47292 KB Output is correct
16 Correct 25 ms 47232 KB Output is correct
17 Correct 26 ms 48000 KB Output is correct
18 Correct 26 ms 47832 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 33 ms 47828 KB Output is correct
21 Correct 30 ms 48044 KB Output is correct
22 Correct 32 ms 48068 KB Output is correct
23 Correct 28 ms 48084 KB Output is correct
24 Correct 505 ms 122468 KB Output is correct
25 Correct 362 ms 109912 KB Output is correct
26 Correct 460 ms 122452 KB Output is correct
27 Correct 353 ms 109916 KB Output is correct
28 Correct 498 ms 116212 KB Output is correct
29 Correct 375 ms 116192 KB Output is correct
30 Correct 1125 ms 127736 KB Output is correct
31 Correct 312 ms 97404 KB Output is correct
32 Correct 114 ms 72272 KB Output is correct
33 Correct 607 ms 109520 KB Output is correct
34 Correct 904 ms 123644 KB Output is correct
35 Correct 1067 ms 128276 KB Output is correct
36 Correct 1035 ms 127416 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47236 KB Output is correct
2 Correct 24 ms 47240 KB Output is correct
3 Correct 23 ms 47320 KB Output is correct
4 Correct 22 ms 47316 KB Output is correct
5 Correct 24 ms 47316 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 22 ms 47336 KB Output is correct
9 Correct 28 ms 47240 KB Output is correct
10 Correct 26 ms 47220 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 23 ms 47316 KB Output is correct
13 Correct 29 ms 47240 KB Output is correct
14 Correct 25 ms 47308 KB Output is correct
15 Correct 25 ms 47292 KB Output is correct
16 Correct 25 ms 47232 KB Output is correct
17 Correct 26 ms 48000 KB Output is correct
18 Correct 26 ms 47832 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 33 ms 47828 KB Output is correct
21 Correct 30 ms 48044 KB Output is correct
22 Correct 32 ms 48068 KB Output is correct
23 Correct 28 ms 48084 KB Output is correct
24 Correct 505 ms 122468 KB Output is correct
25 Correct 362 ms 109912 KB Output is correct
26 Correct 460 ms 122452 KB Output is correct
27 Correct 353 ms 109916 KB Output is correct
28 Correct 498 ms 116212 KB Output is correct
29 Correct 375 ms 116192 KB Output is correct
30 Correct 1125 ms 127736 KB Output is correct
31 Correct 312 ms 97404 KB Output is correct
32 Correct 114 ms 72272 KB Output is correct
33 Correct 607 ms 109520 KB Output is correct
34 Correct 904 ms 123644 KB Output is correct
35 Correct 1067 ms 128276 KB Output is correct
36 Correct 1035 ms 127416 KB Output is correct
37 Correct 532 ms 122516 KB Output is correct
38 Correct 330 ms 109932 KB Output is correct
39 Correct 384 ms 116204 KB Output is correct
40 Correct 486 ms 116144 KB Output is correct
41 Correct 21 ms 47220 KB Output is correct
42 Correct 1122 ms 127736 KB Output is correct
43 Correct 639 ms 109416 KB Output is correct
44 Correct 892 ms 122916 KB Output is correct
45 Correct 1109 ms 128212 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47236 KB Output is correct
2 Correct 24 ms 47240 KB Output is correct
3 Correct 23 ms 47320 KB Output is correct
4 Correct 22 ms 47316 KB Output is correct
5 Correct 24 ms 47316 KB Output is correct
6 Correct 24 ms 47316 KB Output is correct
7 Correct 22 ms 47316 KB Output is correct
8 Correct 22 ms 47336 KB Output is correct
9 Correct 28 ms 47240 KB Output is correct
10 Correct 26 ms 47220 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 23 ms 47316 KB Output is correct
13 Correct 29 ms 47240 KB Output is correct
14 Correct 25 ms 47308 KB Output is correct
15 Correct 25 ms 47292 KB Output is correct
16 Correct 25 ms 47232 KB Output is correct
17 Correct 26 ms 48000 KB Output is correct
18 Correct 26 ms 47832 KB Output is correct
19 Correct 28 ms 48108 KB Output is correct
20 Correct 33 ms 47828 KB Output is correct
21 Correct 30 ms 48044 KB Output is correct
22 Correct 32 ms 48068 KB Output is correct
23 Correct 28 ms 48084 KB Output is correct
24 Correct 505 ms 122468 KB Output is correct
25 Correct 362 ms 109912 KB Output is correct
26 Correct 460 ms 122452 KB Output is correct
27 Correct 353 ms 109916 KB Output is correct
28 Correct 498 ms 116212 KB Output is correct
29 Correct 375 ms 116192 KB Output is correct
30 Correct 1125 ms 127736 KB Output is correct
31 Correct 312 ms 97404 KB Output is correct
32 Correct 114 ms 72272 KB Output is correct
33 Correct 607 ms 109520 KB Output is correct
34 Correct 904 ms 123644 KB Output is correct
35 Correct 1067 ms 128276 KB Output is correct
36 Correct 1035 ms 127416 KB Output is correct
37 Correct 532 ms 122516 KB Output is correct
38 Correct 330 ms 109932 KB Output is correct
39 Correct 384 ms 116204 KB Output is correct
40 Correct 486 ms 116144 KB Output is correct
41 Correct 21 ms 47220 KB Output is correct
42 Correct 1122 ms 127736 KB Output is correct
43 Correct 639 ms 109416 KB Output is correct
44 Correct 892 ms 122916 KB Output is correct
45 Correct 1109 ms 128212 KB Output is correct
46 Correct 2755 ms 454216 KB Output is correct
47 Correct 1747 ms 397500 KB Output is correct
48 Correct 1832 ms 419224 KB Output is correct
49 Correct 2489 ms 419152 KB Output is correct
50 Correct 7368 ms 488824 KB Output is correct
51 Correct 3936 ms 389760 KB Output is correct
52 Correct 4913 ms 437240 KB Output is correct
53 Correct 6922 ms 465300 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 117496 KB Output is correct
2 Correct 448 ms 119208 KB Output is correct
3 Correct 411 ms 116128 KB Output is correct
4 Correct 291 ms 106416 KB Output is correct
5 Correct 22 ms 47232 KB Output is correct
6 Correct 407 ms 115944 KB Output is correct
7 Correct 258 ms 96068 KB Output is correct
8 Correct 106 ms 66048 KB Output is correct
9 Correct 374 ms 116188 KB Output is correct
10 Correct 364 ms 116196 KB Output is correct
11 Correct 350 ms 116252 KB Output is correct
12 Correct 21 ms 47236 KB Output is correct
13 Correct 24 ms 47240 KB Output is correct
14 Correct 23 ms 47320 KB Output is correct
15 Correct 22 ms 47316 KB Output is correct
16 Correct 24 ms 47316 KB Output is correct
17 Correct 24 ms 47316 KB Output is correct
18 Correct 22 ms 47316 KB Output is correct
19 Correct 22 ms 47336 KB Output is correct
20 Correct 28 ms 47240 KB Output is correct
21 Correct 26 ms 47220 KB Output is correct
22 Correct 25 ms 47224 KB Output is correct
23 Correct 23 ms 47316 KB Output is correct
24 Correct 29 ms 47240 KB Output is correct
25 Correct 25 ms 47308 KB Output is correct
26 Correct 25 ms 47292 KB Output is correct
27 Correct 25 ms 47232 KB Output is correct
28 Correct 26 ms 48000 KB Output is correct
29 Correct 26 ms 47832 KB Output is correct
30 Correct 28 ms 48108 KB Output is correct
31 Correct 33 ms 47828 KB Output is correct
32 Correct 30 ms 48044 KB Output is correct
33 Correct 32 ms 48068 KB Output is correct
34 Correct 28 ms 48084 KB Output is correct
35 Correct 505 ms 122468 KB Output is correct
36 Correct 362 ms 109912 KB Output is correct
37 Correct 460 ms 122452 KB Output is correct
38 Correct 353 ms 109916 KB Output is correct
39 Correct 498 ms 116212 KB Output is correct
40 Correct 375 ms 116192 KB Output is correct
41 Correct 1125 ms 127736 KB Output is correct
42 Correct 312 ms 97404 KB Output is correct
43 Correct 114 ms 72272 KB Output is correct
44 Correct 607 ms 109520 KB Output is correct
45 Correct 904 ms 123644 KB Output is correct
46 Correct 1067 ms 128276 KB Output is correct
47 Correct 1035 ms 127416 KB Output is correct
48 Correct 532 ms 122516 KB Output is correct
49 Correct 330 ms 109932 KB Output is correct
50 Correct 384 ms 116204 KB Output is correct
51 Correct 486 ms 116144 KB Output is correct
52 Correct 21 ms 47220 KB Output is correct
53 Correct 1122 ms 127736 KB Output is correct
54 Correct 639 ms 109416 KB Output is correct
55 Correct 892 ms 122916 KB Output is correct
56 Correct 1109 ms 128212 KB Output is correct
57 Incorrect 466 ms 122948 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 117496 KB Output is correct
2 Correct 448 ms 119208 KB Output is correct
3 Correct 411 ms 116128 KB Output is correct
4 Correct 291 ms 106416 KB Output is correct
5 Correct 22 ms 47232 KB Output is correct
6 Correct 407 ms 115944 KB Output is correct
7 Correct 258 ms 96068 KB Output is correct
8 Correct 106 ms 66048 KB Output is correct
9 Correct 374 ms 116188 KB Output is correct
10 Correct 364 ms 116196 KB Output is correct
11 Correct 350 ms 116252 KB Output is correct
12 Correct 21 ms 47236 KB Output is correct
13 Correct 24 ms 47240 KB Output is correct
14 Correct 23 ms 47320 KB Output is correct
15 Correct 22 ms 47316 KB Output is correct
16 Correct 24 ms 47316 KB Output is correct
17 Correct 24 ms 47316 KB Output is correct
18 Correct 22 ms 47316 KB Output is correct
19 Correct 22 ms 47336 KB Output is correct
20 Correct 28 ms 47240 KB Output is correct
21 Correct 26 ms 47220 KB Output is correct
22 Correct 25 ms 47224 KB Output is correct
23 Correct 23 ms 47316 KB Output is correct
24 Correct 29 ms 47240 KB Output is correct
25 Correct 25 ms 47308 KB Output is correct
26 Correct 25 ms 47292 KB Output is correct
27 Correct 25 ms 47232 KB Output is correct
28 Correct 26 ms 48000 KB Output is correct
29 Correct 26 ms 47832 KB Output is correct
30 Correct 28 ms 48108 KB Output is correct
31 Correct 33 ms 47828 KB Output is correct
32 Correct 30 ms 48044 KB Output is correct
33 Correct 32 ms 48068 KB Output is correct
34 Correct 28 ms 48084 KB Output is correct
35 Correct 505 ms 122468 KB Output is correct
36 Correct 362 ms 109912 KB Output is correct
37 Correct 460 ms 122452 KB Output is correct
38 Correct 353 ms 109916 KB Output is correct
39 Correct 498 ms 116212 KB Output is correct
40 Correct 375 ms 116192 KB Output is correct
41 Correct 1125 ms 127736 KB Output is correct
42 Correct 312 ms 97404 KB Output is correct
43 Correct 114 ms 72272 KB Output is correct
44 Correct 607 ms 109520 KB Output is correct
45 Correct 904 ms 123644 KB Output is correct
46 Correct 1067 ms 128276 KB Output is correct
47 Correct 1035 ms 127416 KB Output is correct
48 Correct 532 ms 122516 KB Output is correct
49 Correct 330 ms 109932 KB Output is correct
50 Correct 384 ms 116204 KB Output is correct
51 Correct 486 ms 116144 KB Output is correct
52 Correct 21 ms 47220 KB Output is correct
53 Correct 1122 ms 127736 KB Output is correct
54 Correct 639 ms 109416 KB Output is correct
55 Correct 892 ms 122916 KB Output is correct
56 Correct 1109 ms 128212 KB Output is correct
57 Correct 2755 ms 454216 KB Output is correct
58 Correct 1747 ms 397500 KB Output is correct
59 Correct 1832 ms 419224 KB Output is correct
60 Correct 2489 ms 419152 KB Output is correct
61 Correct 7368 ms 488824 KB Output is correct
62 Correct 3936 ms 389760 KB Output is correct
63 Correct 4913 ms 437240 KB Output is correct
64 Correct 6922 ms 465300 KB Output is correct
65 Incorrect 466 ms 122948 KB Output isn't correct
66 Halted 0 ms 0 KB -