oj.uz

Submission #799719

# Submission time Handle Problem Language Result Execution time Memory
799719 2023-07-31T20:52:51 Z ttamx Progression (NOI20_progression) C++14
100 / 100
 976 ms 98468 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> p2;

const int N=3e5+5;
const int K=1<<20;

int n,q;
ll a[N],b[N];

struct segtree{
    struct node{
        ll sz,ans,all,sum;
        p2 pre,suf;
        node(ll x=0):sz(1),pre(p2(1,x)),suf(p2(1,x)),all(1),ans(1),sum(x){}
        friend node operator+(node a,node b){
            node c;
            bool ok=(a.suf.second==b.pre.second);
            bool oka=(a.suf.first==a.sz);
            bool okb=(b.pre.first==b.sz);
            c.sz=a.sz+b.sz;
            c.sum=a.sum+b.sum;
            if(ok&&oka){
                c.pre=b.pre;
                c.pre.first+=a.sz;
            }else{
                c.pre=a.pre;
            }
            if(ok&&okb){
                c.suf=a.suf;
                c.suf.first+=b.sz;
            }else{
                c.suf=b.suf;
            }
            if(ok&&oka&&okb){
                c.all=a.sz+b.sz;
            }else{
                c.all=0;
            }
            c.ans=max(a.ans,b.ans);
            if(ok){
                c.ans=max(c.ans,a.suf.first+b.pre.first);
            }
            return c;
        }
    }t[K];
    ll lz[K],lz2[K];
    bool islz[K];
    void pushlz(int l,int r,int i){
        if(islz[i]){
            t[i].all=t[i].ans=t[i].sz;
            t[i].sum=t[i].sz*(lz[i]+lz2[i]);
            t[i].pre=t[i].suf=p2(t[i].sz,lz[i]+lz2[i]);
            if(l<r){
                lz[i*2]=lz[i*2+1]=lz[i];
                lz2[i*2]=lz2[i*2+1]=lz2[i];
                islz[i*2]=islz[i*2+1]=true;
            }
        }else{
            t[i].sum+=t[i].sz*lz[i];
            t[i].pre.second+=lz[i];
            t[i].suf.second+=lz[i];
            if(l<r){
                lz[i*2]+=lz[i];
                lz[i*2+1]+=lz[i];
            }
        }
        lz[i]=lz2[i]=0;
        islz[i]=false;
    }
    void build(int l,int r,int i){
        if(l==r)return void(t[i]=b[l]);
        int m=(l+r)/2;
        build(l,m,i*2);
        build(m+1,r,i*2+1);
        t[i]=t[i*2]+t[i*2+1];
    }
    void build(){
        build(1,n+1,1);
    }
    void update(int l,int r,int i,int x,int y,ll v){
        pushlz(l,r,i);
        if(y<l||r<x)return;
        if(x<=l&&r<=y)return lz[i]=v,pushlz(l,r,i),void();
        int m=(l+r)/2;
        update(l,m,i*2,x,y,v);
        update(m+1,r,i*2+1,x,y,v);
        t[i]=t[i*2]+t[i*2+1];
    }
    void update(int x,int y,ll v){
        update(1,n+1,1,x,y,v);
    }
    void update2(int l,int r,int i,int x,int y,ll v){
        pushlz(l,r,i);
        if(y<l||r<x)return;
        if(x<=l&&r<=y)return islz[i]=true,lz2[i]=v,pushlz(l,r,i),void();
        int m=(l+r)/2;
        update2(l,m,i*2,x,y,v);
        update2(m+1,r,i*2+1,x,y,v);
        t[i]=t[i*2]+t[i*2+1];
    }
    void update2(int x,int y,ll v){
        update2(1,n+1,1,x,y,v);
    }
    node query(int l,int r,int i,int x,int y){
        pushlz(l,r,i);
        if(x<=l&&r<=y)return t[i];
        int m=(l+r)/2;
        if(x<=m&&m<y)return query(l,m,i*2,x,y)+query(m+1,r,i*2+1,x,y);
        if(x<=m)return query(l,m,i*2,x,y);
        else return query(m+1,r,i*2+1,x,y);
    }
    node query(int x,int y){
        return query(1,n+1,1,x,y);
    }
}s;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> q;
    for(int i=1;i<=n;i++)cin >> a[i];
    for(int i=1;i<=n;i++)b[i]=a[i]-a[i-1];
    s.build();
    while(q--){
        int t;
        cin >> t;
        if(t==1){
            ll l,r,a,b;
            cin >> l >> r >> a >> b;
            s.update(l,l,a);
            s.update(l+1,r,b);
            s.update(r+1,r+1,-a-(r-l)*b);
        }else if(t==2){
            ll l,r,a,b;
            cin >> l >> r >> a >> b;
            ll le=(l==1?0:s.query(1,l-1).sum);
            ll ri=s.query(1,r+1).sum;
            s.update2(l,l,a-le);
            s.update2(r+1,r+1,ri-a-(r-l)*b);
            s.update2(l+1,r,b);
        }else{
            ll l,r;
            cin >> l >> r;
            cout << (l==r?0:s.query(l+1,r).ans)+1 << "\n";
        }
    }
}

Compilation message

Progression.cpp: In constructor 'segtree::node::node(ll)':
Progression.cpp:17:16: warning: 'segtree::node::suf' will be initialized after [-Wreorder]
   17 |         p2 pre,suf;
      |                ^~~
Progression.cpp:16:19: warning:   'll segtree::node::all' [-Wreorder]
   16 |         ll sz,ans,all,sum;
      |                   ^~~
Progression.cpp:18:9: warning:   when initialized here [-Wreorder]
   18 |         node(ll x=0):sz(1),pre(p2(1,x)),suf(p2(1,x)),all(1),ans(1),sum(x){}
      |         ^~~~
Progression.cpp:16:19: warning: 'segtree::node::all' will be initialized after [-Wreorder]
   16 |         ll sz,ans,all,sum;
      |                   ^~~
Progression.cpp:16:15: warning:   'll segtree::node::ans' [-Wreorder]
   16 |         ll sz,ans,all,sum;
      |               ^~~
Progression.cpp:18:9: warning:   when initialized here [-Wreorder]
   18 |         node(ll x=0):sz(1),pre(p2(1,x)),suf(p2(1,x)),all(1),ans(1),sum(x){}
      |         ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 696 ms 79384 KB Output is correct
2 Correct 165 ms 69148 KB Output is correct
3 Correct 171 ms 69240 KB Output is correct
4 Correct 162 ms 69196 KB Output is correct
5 Correct 162 ms 69260 KB Output is correct
6 Correct 184 ms 69304 KB Output is correct
7 Correct 164 ms 69148 KB Output is correct
8 Correct 25 ms 66000 KB Output is correct
9 Correct 25 ms 65960 KB Output is correct
10 Correct 25 ms 65916 KB Output is correct
11 Correct 722 ms 79376 KB Output is correct
12 Correct 728 ms 79272 KB Output is correct
13 Correct 708 ms 79648 KB Output is correct
14 Correct 698 ms 79764 KB Output is correct
15 Correct 697 ms 79604 KB Output is correct
16 Correct 697 ms 79308 KB Output is correct
17 Correct 712 ms 79440 KB Output is correct
18 Correct 698 ms 79344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 66024 KB Output is correct
2 Correct 25 ms 66040 KB Output is correct
3 Correct 24 ms 66004 KB Output is correct
4 Correct 24 ms 65936 KB Output is correct
5 Correct 23 ms 65940 KB Output is correct
6 Correct 24 ms 65900 KB Output is correct
7 Correct 26 ms 66004 KB Output is correct
8 Correct 27 ms 66048 KB Output is correct
9 Correct 25 ms 65992 KB Output is correct
10 Correct 26 ms 65996 KB Output is correct
11 Correct 25 ms 66004 KB Output is correct
12 Correct 26 ms 66004 KB Output is correct
13 Correct 27 ms 65960 KB Output is correct
14 Correct 26 ms 66000 KB Output is correct
15 Correct 26 ms 65980 KB Output is correct
16 Correct 26 ms 66004 KB Output is correct
17 Correct 25 ms 66004 KB Output is correct
18 Correct 24 ms 66048 KB Output is correct
19 Correct 24 ms 65908 KB Output is correct
20 Correct 27 ms 66016 KB Output is correct
21 Correct 24 ms 65916 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 95104 KB Output is correct
2 Correct 93 ms 68684 KB Output is correct
3 Correct 91 ms 68684 KB Output is correct
4 Correct 90 ms 68652 KB Output is correct
5 Correct 103 ms 68748 KB Output is correct
6 Correct 99 ms 68804 KB Output is correct
7 Correct 98 ms 68812 KB Output is correct
8 Correct 31 ms 65976 KB Output is correct
9 Correct 24 ms 65920 KB Output is correct
10 Correct 25 ms 65908 KB Output is correct
11 Correct 311 ms 93772 KB Output is correct
12 Correct 344 ms 95176 KB Output is correct
13 Correct 310 ms 93804 KB Output is correct
14 Correct 320 ms 93800 KB Output is correct
15 Correct 350 ms 95080 KB Output is correct
16 Correct 331 ms 95652 KB Output is correct
17 Correct 321 ms 95660 KB Output is correct
18 Correct 319 ms 95804 KB Output is correct
19 Correct 284 ms 95116 KB Output is correct
20 Correct 287 ms 95112 KB Output is correct
21 Correct 288 ms 95180 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 643 ms 97860 KB Output is correct
2 Correct 159 ms 69332 KB Output is correct
3 Correct 159 ms 69344 KB Output is correct
4 Correct 155 ms 69324 KB Output is correct
5 Correct 160 ms 69268 KB Output is correct
6 Correct 159 ms 69324 KB Output is correct
7 Correct 160 ms 69364 KB Output is correct
8 Correct 28 ms 65920 KB Output is correct
9 Correct 28 ms 65928 KB Output is correct
10 Correct 27 ms 65996 KB Output is correct
11 Correct 641 ms 94708 KB Output is correct
12 Correct 629 ms 97960 KB Output is correct
13 Correct 634 ms 94668 KB Output is correct
14 Correct 653 ms 94668 KB Output is correct
15 Correct 591 ms 97908 KB Output is correct
16 Correct 649 ms 98088 KB Output is correct
17 Correct 638 ms 97984 KB Output is correct
18 Correct 640 ms 98124 KB Output is correct
19 Correct 629 ms 97868 KB Output is correct
20 Correct 646 ms 97880 KB Output is correct
21 Correct 630 ms 97908 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 95104 KB Output is correct
2 Correct 93 ms 68684 KB Output is correct
3 Correct 91 ms 68684 KB Output is correct
4 Correct 90 ms 68652 KB Output is correct
5 Correct 103 ms 68748 KB Output is correct
6 Correct 99 ms 68804 KB Output is correct
7 Correct 98 ms 68812 KB Output is correct
8 Correct 31 ms 65976 KB Output is correct
9 Correct 24 ms 65920 KB Output is correct
10 Correct 25 ms 65908 KB Output is correct
11 Correct 311 ms 93772 KB Output is correct
12 Correct 344 ms 95176 KB Output is correct
13 Correct 310 ms 93804 KB Output is correct
14 Correct 320 ms 93800 KB Output is correct
15 Correct 350 ms 95080 KB Output is correct
16 Correct 331 ms 95652 KB Output is correct
17 Correct 321 ms 95660 KB Output is correct
18 Correct 319 ms 95804 KB Output is correct
19 Correct 284 ms 95116 KB Output is correct
20 Correct 287 ms 95112 KB Output is correct
21 Correct 288 ms 95180 KB Output is correct
22 Correct 668 ms 97396 KB Output is correct
23 Correct 142 ms 69176 KB Output is correct
24 Correct 139 ms 69124 KB Output is correct
25 Correct 140 ms 69120 KB Output is correct
26 Correct 145 ms 69216 KB Output is correct
27 Correct 145 ms 69164 KB Output is correct
28 Correct 144 ms 69256 KB Output is correct
29 Correct 29 ms 65956 KB Output is correct
30 Correct 30 ms 65952 KB Output is correct
31 Correct 29 ms 65960 KB Output is correct
32 Correct 648 ms 94596 KB Output is correct
33 Correct 645 ms 97344 KB Output is correct
34 Correct 676 ms 94612 KB Output is correct
35 Correct 663 ms 94548 KB Output is correct
36 Correct 531 ms 94432 KB Output is correct
37 Correct 534 ms 94376 KB Output is correct
38 Correct 516 ms 94376 KB Output is correct
39 Correct 637 ms 97348 KB Output is correct
40 Correct 656 ms 96952 KB Output is correct
41 Correct 726 ms 96752 KB Output is correct
42 Correct 758 ms 95724 KB Output is correct
43 Correct 689 ms 94240 KB Output is correct
44 Correct 746 ms 93916 KB Output is correct
45 Correct 740 ms 92312 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 696 ms 79384 KB Output is correct
2 Correct 165 ms 69148 KB Output is correct
3 Correct 171 ms 69240 KB Output is correct
4 Correct 162 ms 69196 KB Output is correct
5 Correct 162 ms 69260 KB Output is correct
6 Correct 184 ms 69304 KB Output is correct
7 Correct 164 ms 69148 KB Output is correct
8 Correct 25 ms 66000 KB Output is correct
9 Correct 25 ms 65960 KB Output is correct
10 Correct 25 ms 65916 KB Output is correct
11 Correct 722 ms 79376 KB Output is correct
12 Correct 728 ms 79272 KB Output is correct
13 Correct 708 ms 79648 KB Output is correct
14 Correct 698 ms 79764 KB Output is correct
15 Correct 697 ms 79604 KB Output is correct
16 Correct 697 ms 79308 KB Output is correct
17 Correct 712 ms 79440 KB Output is correct
18 Correct 698 ms 79344 KB Output is correct
19 Correct 30 ms 66024 KB Output is correct
20 Correct 25 ms 66040 KB Output is correct
21 Correct 24 ms 66004 KB Output is correct
22 Correct 24 ms 65936 KB Output is correct
23 Correct 23 ms 65940 KB Output is correct
24 Correct 24 ms 65900 KB Output is correct
25 Correct 26 ms 66004 KB Output is correct
26 Correct 27 ms 66048 KB Output is correct
27 Correct 25 ms 65992 KB Output is correct
28 Correct 26 ms 65996 KB Output is correct
29 Correct 25 ms 66004 KB Output is correct
30 Correct 26 ms 66004 KB Output is correct
31 Correct 27 ms 65960 KB Output is correct
32 Correct 26 ms 66000 KB Output is correct
33 Correct 26 ms 65980 KB Output is correct
34 Correct 26 ms 66004 KB Output is correct
35 Correct 25 ms 66004 KB Output is correct
36 Correct 24 ms 66048 KB Output is correct
37 Correct 24 ms 65908 KB Output is correct
38 Correct 27 ms 66016 KB Output is correct
39 Correct 24 ms 65916 KB Output is correct
40 Correct 343 ms 95104 KB Output is correct
41 Correct 93 ms 68684 KB Output is correct
42 Correct 91 ms 68684 KB Output is correct
43 Correct 90 ms 68652 KB Output is correct
44 Correct 103 ms 68748 KB Output is correct
45 Correct 99 ms 68804 KB Output is correct
46 Correct 98 ms 68812 KB Output is correct
47 Correct 31 ms 65976 KB Output is correct
48 Correct 24 ms 65920 KB Output is correct
49 Correct 25 ms 65908 KB Output is correct
50 Correct 311 ms 93772 KB Output is correct
51 Correct 344 ms 95176 KB Output is correct
52 Correct 310 ms 93804 KB Output is correct
53 Correct 320 ms 93800 KB Output is correct
54 Correct 350 ms 95080 KB Output is correct
55 Correct 331 ms 95652 KB Output is correct
56 Correct 321 ms 95660 KB Output is correct
57 Correct 319 ms 95804 KB Output is correct
58 Correct 284 ms 95116 KB Output is correct
59 Correct 287 ms 95112 KB Output is correct
60 Correct 288 ms 95180 KB Output is correct
61 Correct 643 ms 97860 KB Output is correct
62 Correct 159 ms 69332 KB Output is correct
63 Correct 159 ms 69344 KB Output is correct
64 Correct 155 ms 69324 KB Output is correct
65 Correct 160 ms 69268 KB Output is correct
66 Correct 159 ms 69324 KB Output is correct
67 Correct 160 ms 69364 KB Output is correct
68 Correct 28 ms 65920 KB Output is correct
69 Correct 28 ms 65928 KB Output is correct
70 Correct 27 ms 65996 KB Output is correct
71 Correct 641 ms 94708 KB Output is correct
72 Correct 629 ms 97960 KB Output is correct
73 Correct 634 ms 94668 KB Output is correct
74 Correct 653 ms 94668 KB Output is correct
75 Correct 591 ms 97908 KB Output is correct
76 Correct 649 ms 98088 KB Output is correct
77 Correct 638 ms 97984 KB Output is correct
78 Correct 640 ms 98124 KB Output is correct
79 Correct 629 ms 97868 KB Output is correct
80 Correct 646 ms 97880 KB Output is correct
81 Correct 630 ms 97908 KB Output is correct
82 Correct 668 ms 97396 KB Output is correct
83 Correct 142 ms 69176 KB Output is correct
84 Correct 139 ms 69124 KB Output is correct
85 Correct 140 ms 69120 KB Output is correct
86 Correct 145 ms 69216 KB Output is correct
87 Correct 145 ms 69164 KB Output is correct
88 Correct 144 ms 69256 KB Output is correct
89 Correct 29 ms 65956 KB Output is correct
90 Correct 30 ms 65952 KB Output is correct
91 Correct 29 ms 65960 KB Output is correct
92 Correct 648 ms 94596 KB Output is correct
93 Correct 645 ms 97344 KB Output is correct
94 Correct 676 ms 94612 KB Output is correct
95 Correct 663 ms 94548 KB Output is correct
96 Correct 531 ms 94432 KB Output is correct
97 Correct 534 ms 94376 KB Output is correct
98 Correct 516 ms 94376 KB Output is correct
99 Correct 637 ms 97348 KB Output is correct
100 Correct 656 ms 96952 KB Output is correct
101 Correct 726 ms 96752 KB Output is correct
102 Correct 758 ms 95724 KB Output is correct
103 Correct 689 ms 94240 KB Output is correct
104 Correct 746 ms 93916 KB Output is correct
105 Correct 740 ms 92312 KB Output is correct
106 Correct 976 ms 98344 KB Output is correct
107 Correct 201 ms 69368 KB Output is correct
108 Correct 195 ms 69424 KB Output is correct
109 Correct 198 ms 69424 KB Output is correct
110 Correct 30 ms 65984 KB Output is correct
111 Correct 29 ms 65980 KB Output is correct
112 Correct 29 ms 65968 KB Output is correct
113 Correct 765 ms 97436 KB Output is correct
114 Correct 736 ms 97472 KB Output is correct
115 Correct 709 ms 97352 KB Output is correct
116 Correct 691 ms 97400 KB Output is correct
117 Correct 946 ms 98276 KB Output is correct
118 Correct 687 ms 97404 KB Output is correct
119 Correct 658 ms 97292 KB Output is correct
120 Correct 341 ms 95972 KB Output is correct
121 Correct 344 ms 95828 KB Output is correct
122 Correct 329 ms 95904 KB Output is correct
123 Correct 312 ms 95040 KB Output is correct
124 Correct 313 ms 95060 KB Output is correct
125 Correct 312 ms 95108 KB Output is correct
126 Correct 838 ms 95048 KB Output is correct
127 Correct 892 ms 95040 KB Output is correct
128 Correct 881 ms 98372 KB Output is correct
129 Correct 908 ms 94992 KB Output is correct
130 Correct 626 ms 95068 KB Output is correct
131 Correct 608 ms 95180 KB Output is correct
132 Correct 601 ms 95080 KB Output is correct
133 Correct 861 ms 98444 KB Output is correct
134 Correct 893 ms 98344 KB Output is correct
135 Correct 848 ms 98468 KB Output is correct
136 Correct 192 ms 69440 KB Output is correct
137 Correct 190 ms 69324 KB Output is correct
138 Correct 219 ms 69336 KB Output is correct