oj.uz

답안 #839238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839238 2023-08-29T10:17:24 Z 8pete8 Progression (NOI20_progression) C++17
68 / 100
 836 ms 79040 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<algorithm>
#include<limits.h>
#include<cmath>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,int>
#define pb push_back
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define mod 1000000007
const int mxn=4*1e5,lg=20,inf=1e18;
int n,m;
struct node{
    int as=0,ms=1,ls=0,rs=0,lv=0,rv=0,sum=0;
    //all size, max size, left size,right size,left val,right val;
};
void print(node a){
    cout<<a.as<<" "<<a.ms<<" "<<a.ls<<" "<<a.rs<<" "<<a.lv<<" "<<a.rv<<'\n';
}
node seg[4*mxn+10];
int add[4*mxn+10],change[4*mxn+10],v[mxn+10];
bool yes[4*mxn+10];
int h;//height of tree
node comb(node a,node b){
    node tmp;
    if(a.rv==inf)return b;
    if(b.rv==inf)return a;
    tmp.ms=max(a.ms,b.ms);
    if(a.rv==b.lv)tmp.ms=max(tmp.ms,a.rs+b.ls);
    tmp.lv=a.lv;
    tmp.rv=b.rv;
    if(a.ls==a.as&&b.lv==a.lv)tmp.ls=a.ls+b.ls;
    if(b.rs==b.as&&a.rv==b.rv)tmp.rs=b.rs+a.rs;
    tmp.ls=max(tmp.ls,a.ls);
    tmp.rs=max(tmp.rs,b.rs);
    tmp.as=a.as+b.as;
    tmp.sum=a.sum+b.sum;
    return tmp;
}
void build(int pos,int l,int r){
   // cout<<pos<<" "<<l<<" "<<r<<'\n';
   if(r<l)return;
    if(l==r){
        seg[pos].as=seg[pos].ls=seg[pos].rs=seg[pos].ms=1;
        seg[pos].lv=seg[pos].rv=seg[pos].sum=v[l];
    }
    else{
        int mid=l+(r-l)/2;
        build(pos*2,l,mid);
        build(pos*2+1,mid+1,r);
        seg[pos]=comb(seg[pos<<1],seg[(pos<<1)|1]);
    }
}
void app(int pos){
    if(yes[pos]){
        seg[pos].ms=seg[pos].ls=seg[pos].rs=seg[pos].as;
        seg[pos].lv=seg[pos].rv=change[pos];
        seg[pos].sum=seg[pos].as*change[pos];
    }
    if(add[pos]){
        seg[pos].lv+=add[pos];
        seg[pos].rv+=add[pos];
        seg[pos].sum+=(seg[pos].as*add[pos]);
    }
}
void push(int pos,int l,int r){
    if(add[pos]){
        app(pos);
        if(l!=r){
            add[pos*2]+=add[pos];
            add[pos*2+1]+=add[pos];
        }
    }
    if(yes[pos]){
        app(pos);
        if(l!=r){
            add[pos*2]=0;
            add[pos*2+1]=0;
            yes[pos*2]=true;
            yes[pos*2+1]=true;
            change[pos*2]=change[pos];
            change[pos*2+1]=change[pos];
        }
    }
    add[pos]=0;
    yes[pos]=false;
    change[pos]=0;
}
void update(int pos,int l,int r,int ql,int qr,int val){
    if(r<l)return;
    push(pos,l,r);
    //cout<<pos<<' '<<l<<" "<<r<<' '<<ql<<" "<<qr<<'\n';
    if(r<ql||l>qr)return;
    if(ql<=l&&r<=qr){
        add[pos]+=val;
        push(pos,l,r);
        return;
    }
    int mid=l+(r-l)/2;
    update(pos*2,l,mid,ql,qr,val);
    update(pos*2+1,mid+1,r,ql,qr,val);
    seg[pos]=comb(seg[pos*2],seg[pos*2+1]);
}
void update2(int pos,int l,int r,int ql,int qr,int val){
    if(r<l)return;
    if(r<ql||l>qr)return;
    //cout<<pos<<" "<<l<<" "<<r<<" "<<ql<<" "<<qr<<" "<<val<<'\n';
    if(ql<=l&&r<=qr){
        change[pos]=val;
        yes[pos]=true;
        add[pos]=0;
        push(pos,l,r);
        return;
    }
    push(pos,l,r);
    int mid=l+(r-l)/2;
    update2(pos*2,l,mid,ql,qr,val);
    update2(pos*2+1,mid+1,r,ql,qr,val);
    seg[pos]=comb(seg[pos<<1],seg[(pos<<1)|1]);
}
node query(int pos,int l,int r,int ql,int qr){
    node tmp;
    tmp.rv=inf;
    if(r<l)return tmp;
    if(r<ql||l>qr)return tmp;
    push(pos,l,r);
    if(ql<=l&&r<=qr)return seg[pos];
    int mid=l+(r-l)/2;
    if(l<=ql&&qr<=mid)return query(pos*2,l,mid,ql,qr);
    if(ql>=mid+1&&qr<=r)return query(pos*2+1,mid+1,r,ql,qr);
    return comb(query(pos*2,l,mid,ql,qr),query(pos*2+1,mid+1,r,ql,qr));
}
int32_t main(){
    fastio
    int n,m;cin>>n>>m;
    for(int i=0;i<n;i++)cin>>v[i];
    int val=v[0];
    n--;
    for(int i=0;i<n;i++)v[i]=v[i+1]-v[i];
    build(1,0,n-1);
    int diff;
    while(m--){
        int type;cin>>type;
        if(type==1){
            int l,r,x,c;cin>>l>>r>>x>>c;
            l--,r--;
            if(l)update(1,0,n-1,l-1,l-1,x);
            else val+=x;
            if(r<n)update(1,0,n-1,r,r,-((x+((r-l)*c))));
            if(l!=r)update(1,0,n-1,l,r-1,c);
        }
        else if(type==2){
            int l,r,x,c;cin>>l>>r>>x>>c;
            l--,r--;
            int suml,sumr;
            if(r<n){
                if(r)sumr=query(1,0,n-1,0,r-1).sum+val;
                else sumr=val;
                diff=sumr-(x+(r-l)*c);
                update(1,0,n-1,r,r,diff);
            }
            if(l){
                suml=query(1,0,n-1,0,l-1).sum+val;
                diff=x-suml;
                update(1,0,n-1,l-1,l-1,diff);
            }
            else val=x;
            if(l!=r)update2(1,0,n-1,l,r-1,c);
        }
        else{
            int l,r;cin>>l>>r;
            l--;
            r--;
            cout<<((l==r)?0:query(1,0,n-1,l,r-1).ms)+1<<'\n';
        }
    }
 
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 60748 KB Output is correct
2 Correct 62 ms 588 KB Output is correct
3 Correct 64 ms 588 KB Output is correct
4 Correct 63 ms 588 KB Output is correct
5 Correct 63 ms 716 KB Output is correct
6 Correct 72 ms 720 KB Output is correct
7 Correct 66 ms 588 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 153 ms 60680 KB Output is correct
12 Correct 128 ms 60620 KB Output is correct
13 Correct 148 ms 61004 KB Output is correct
14 Correct 133 ms 61064 KB Output is correct
15 Correct 130 ms 61032 KB Output is correct
16 Correct 140 ms 60704 KB Output is correct
17 Correct 127 ms 60704 KB Output is correct
18 Correct 129 ms 60680 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 78560 KB Output is correct
2 Correct 66 ms 844 KB Output is correct
3 Correct 63 ms 876 KB Output is correct
4 Correct 58 ms 896 KB Output is correct
5 Correct 67 ms 1100 KB Output is correct
6 Correct 78 ms 1088 KB Output is correct
7 Correct 69 ms 972 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 321 ms 78448 KB Output is correct
12 Correct 252 ms 78668 KB Output is correct
13 Correct 340 ms 78328 KB Output is correct
14 Correct 318 ms 78284 KB Output is correct
15 Correct 247 ms 78540 KB Output is correct
16 Correct 331 ms 78852 KB Output is correct
17 Correct 307 ms 78844 KB Output is correct
18 Correct 304 ms 79040 KB Output is correct
19 Correct 264 ms 78368 KB Output is correct
20 Correct 259 ms 78212 KB Output is correct
21 Correct 245 ms 78252 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 674 ms 77804 KB Output is correct
2 Correct 150 ms 508 KB Output is correct
3 Correct 132 ms 460 KB Output is correct
4 Correct 131 ms 524 KB Output is correct
5 Correct 134 ms 460 KB Output is correct
6 Correct 135 ms 492 KB Output is correct
7 Correct 164 ms 460 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 665 ms 77756 KB Output is correct
12 Correct 641 ms 77772 KB Output is correct
13 Correct 685 ms 77808 KB Output is correct
14 Correct 743 ms 77864 KB Output is correct
15 Correct 640 ms 77820 KB Output is correct
16 Correct 694 ms 77868 KB Output is correct
17 Correct 683 ms 77892 KB Output is correct
18 Correct 698 ms 77856 KB Output is correct
19 Correct 665 ms 77788 KB Output is correct
20 Correct 654 ms 77792 KB Output is correct
21 Correct 699 ms 77764 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 78560 KB Output is correct
2 Correct 66 ms 844 KB Output is correct
3 Correct 63 ms 876 KB Output is correct
4 Correct 58 ms 896 KB Output is correct
5 Correct 67 ms 1100 KB Output is correct
6 Correct 78 ms 1088 KB Output is correct
7 Correct 69 ms 972 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 321 ms 78448 KB Output is correct
12 Correct 252 ms 78668 KB Output is correct
13 Correct 340 ms 78328 KB Output is correct
14 Correct 318 ms 78284 KB Output is correct
15 Correct 247 ms 78540 KB Output is correct
16 Correct 331 ms 78852 KB Output is correct
17 Correct 307 ms 78844 KB Output is correct
18 Correct 304 ms 79040 KB Output is correct
19 Correct 264 ms 78368 KB Output is correct
20 Correct 259 ms 78212 KB Output is correct
21 Correct 245 ms 78252 KB Output is correct
22 Correct 794 ms 78052 KB Output is correct
23 Correct 144 ms 608 KB Output is correct
24 Correct 128 ms 644 KB Output is correct
25 Correct 129 ms 588 KB Output is correct
26 Correct 137 ms 588 KB Output is correct
27 Correct 134 ms 652 KB Output is correct
28 Correct 158 ms 588 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 791 ms 78012 KB Output is correct
33 Correct 805 ms 77936 KB Output is correct
34 Correct 820 ms 77980 KB Output is correct
35 Correct 818 ms 77980 KB Output is correct
36 Correct 625 ms 78160 KB Output is correct
37 Correct 643 ms 78236 KB Output is correct
38 Correct 644 ms 78220 KB Output is correct
39 Correct 759 ms 77900 KB Output is correct
40 Correct 805 ms 77980 KB Output is correct
41 Correct 836 ms 77984 KB Output is correct
42 Correct 829 ms 77980 KB Output is correct
43 Correct 758 ms 77932 KB Output is correct
44 Correct 752 ms 77996 KB Output is correct
45 Correct 745 ms 77900 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 60748 KB Output is correct
2 Correct 62 ms 588 KB Output is correct
3 Correct 64 ms 588 KB Output is correct
4 Correct 63 ms 588 KB Output is correct
5 Correct 63 ms 716 KB Output is correct
6 Correct 72 ms 720 KB Output is correct
7 Correct 66 ms 588 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 153 ms 60680 KB Output is correct
12 Correct 128 ms 60620 KB Output is correct
13 Correct 148 ms 61004 KB Output is correct
14 Correct 133 ms 61064 KB Output is correct
15 Correct 130 ms 61032 KB Output is correct
16 Correct 140 ms 60704 KB Output is correct
17 Correct 127 ms 60704 KB Output is correct
18 Correct 129 ms 60680 KB Output is correct
19 Incorrect 2 ms 468 KB Output isn't correct
20 Halted 0 ms 0 KB -