oj.uz

Submission #795072

# Submission time Handle Problem Language Result Execution time Memory
795072 2023-07-27T05:58:44 Z ttamx Sjeckanje (COCI21_sjeckanje) C++14
110 / 110
 505 ms 22864 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=2e5+5;
const int K=1<<19;
const ll inf=1e18;

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

struct mat:array<array<ll,2>,2>{
    mat(ll x=0){
        for(int i=0;i<2;i++)for(int j=0;j<2;j++)(*this)[i][j]=x;
    }
    mat(ll a,ll b){
        (*this)[0][0]=a;
        (*this)[0][1]=0;
        (*this)[1][0]=b;
        (*this)[1][1]=-inf;
    }
    friend mat operator*(mat a,mat b){
        mat c(-inf);
        for(int i=0;i<2;i++){
            for(int j=0;j<2;j++){
                for(int k=0;k<2;k++){
                    c[i][j]=max(c[i][j],a[i][k]+b[k][j]);
                }
            }
        }
        return c;
    }
};

struct segtree{
    mat t[K];
    void build(int l,int r,int i){
        if(l==r)return void(t[i]=mat((d[l]^d[l-1])<0?0:abs(d[l]),abs(d[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(2,n,1);
    }
    void update(int l,int r,int i,int x){
        if(x<l||r<x)return;
        if(l==r)return void(t[i]=mat((d[l]^d[l-1])<0?0:abs(d[l]),abs(d[l])));
        int m=(l+r)/2;
        update(l,m,i*2,x);
        update(m+1,r,i*2+1,x);
        t[i]=t[i*2]*t[i*2+1];
    }
    void update(int x){
        update(2,n,1,x);
    }
}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++)d[i]=a[i]-a[i-1];
    s.build();
    while(q--){
        int l,r,x;
        cin >> l >> r >> x;
        d[l]+=x;
        d[r+1]-=x;
        s.update(l);
        s.update(l+1);
        s.update(r+1);
        s.update(r+2);
        cout << max(s.t[1][0][0],s.t[1][1][0]) << "\n";
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16668 KB Output is correct
2 Correct 9 ms 16736 KB Output is correct
3 Correct 7 ms 16724 KB Output is correct
4 Correct 7 ms 16708 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 7 ms 16668 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16668 KB Output is correct
2 Correct 9 ms 16736 KB Output is correct
3 Correct 7 ms 16724 KB Output is correct
4 Correct 7 ms 16708 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 7 ms 16668 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 11 ms 16724 KB Output is correct
9 Correct 15 ms 16836 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 11 ms 16724 KB Output is correct
12 Correct 12 ms 16800 KB Output is correct

Subtask #3
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16668 KB Output is correct
2 Correct 9 ms 16736 KB Output is correct
3 Correct 7 ms 16724 KB Output is correct
4 Correct 7 ms 16708 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 7 ms 16668 KB Output is correct
7 Correct 11 ms 16724 KB Output is correct
8 Correct 11 ms 16724 KB Output is correct
9 Correct 15 ms 16836 KB Output is correct
10 Correct 11 ms 16724 KB Output is correct
11 Correct 11 ms 16724 KB Output is correct
12 Correct 12 ms 16800 KB Output is correct
13 Correct 505 ms 22624 KB Output is correct
14 Correct 490 ms 22676 KB Output is correct
15 Correct 504 ms 22720 KB Output is correct
16 Correct 495 ms 22640 KB Output is correct
17 Correct 483 ms 22612 KB Output is correct
18 Correct 501 ms 22864 KB Output is correct