Submission #1266074

#TimeUsernameProblemLanguageResultExecution timeMemory
1266074trinm01Foehn Phenomena (JOI17_foehn_phenomena)C++20
100 / 100
333 ms15088 KiB
// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll oo = 1e18+7;  
const int base = 0;

int n, q, s, t, a[MAXN];

int st[4*MAXN], lz[4*MAXN];
void push(int id){
    if(lz[id]!=0){
        int val=lz[id];
        st[id*2]+=val;
        st[id*2+1]+=val;
        lz[id*2]+=val;
        lz[id*2+1]+=val;
        lz[id]=0;
    }
}
void update(int id, int l, int r, int i, int j, int val){
    if(l>j || r<i){
        return;
    }
    if(l>=i && r<=j){
        st[id]+=val;
        lz[id]+=val;
        return;
    }
    int mid=(l+r)/2;
    push(id);
    update(id*2, l, mid, i, j, val);
    update(id*2+1, mid+1, r, i, j, val);
}
int get(int id, int l, int r, int i){
    if(l>i || r<i){
        return 0;
    }
    if(l>=r){
        return st[id];
    }
    int mid=(l+r)/2;
    push(id);
    return get(id*2, l, mid, i)+get(id*2+1, mid+1, r, i);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout); 

    // if(fopen(".inp", "r")){
    //     freopen(".inp", "r", stdin);
    //     freopen(".out", "w", stdout);
    // }   

    cin >> n >> q >> s >> t;
    FOR(i, 0, n){
        cin >> a[i];
    }

    FOR(i, 0, n){
        update(1, 0, n, i, i, a[i]);
    }

    // FOR(i, 0, n){
    //     cout << get(1, 0, n, i) << ' ';
    // }

    int sum=0;
    FOR(i, 1, n){
        if(a[i-1]<a[i]){
            sum-=s*(a[i]-a[i-1]);
        }
        else{
            sum+=t*(a[i-1]-a[i]);
        }
    }

    while(q--){
        int l, r, x;
        cin >> l >> r >> x;
        int x0, x1;
        x1=get(1, 0, n, l); 
        x0=get(1, 0, n, l-1);
        if(x0<x1){
            sum+=s*(x1-x0);
        }
        else{
            sum-=t*(x0-x1);
        }
        if(r+1<=n){
            x0=get(1, 0, n, r);
            x1=get(1, 0, n, r+1);
            if(x0<x1){
                sum+=s*(x1-x0);
            }
            else{
                sum-=t*(x0-x1);
            }
        }
        update(1, 0, n, l, r, x);
        x1=get(1, 0, n, l); 
        x0=get(1, 0, n, l-1);
        if(x0<x1){
            sum-=s*(x1-x0);
        }
        else{
            sum+=t*(x0-x1);
        }
        if(r+1<=n){
            x0=get(1, 0, n, r);
            x1=get(1, 0, n, r+1);
            if(x0<x1){
                sum-=s*(x1-x0);
            }
            else{
                sum+=t*(x0-x1);
            }
        }
        cout << sum << '\n';
    }
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...