제출 #1272123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272123		nonjapenzil	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	204 ms	7284 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define pf(a) printf("%.9f", a)
#define SZ size()
#define ll long long
#define pb push_back
#define BBC ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void W2dNHK() {
    ll n,q,s,t;
    cin>>n>>q>>s>>t;
    ll i;
    ll k[n+11];
    ll z[n+11];
    ll ans=0;
    for(i=0 ; i<=n ; i++ ){
        cin>>k[i];
        if(i>0){
            z[i]=k[i]-k[i-1];
            if(z[i]>=0){
                ans-=s*z[i];
            }
            else{
                ans-=t*z[i];
            }
        }
    }
    while(q--){
        ll l,r,x;
        cin>>l>>r>>x;
        ll zl=z[l];
        z[l]+=x;
        if(zl>=0){
            if(z[l]>=0){
                ans-=(z[l]-zl)*s;
            }
            else{
                ans+=zl*s;
                ans-=z[l]*t;
            }
        }
        else{
            if(z[l]<0){
                ans-=(z[l]-zl)*t;
            }
            else{
                ans+=zl*t;
                ans-=z[l]*s;
            }
        }
        if(r==n){
            cout<<ans<<endl;
            continue;
        }
        ll zr=z[r+1];
        z[r+1]-=x;
        if(zr>=0){
            if(z[r+1]>=0){
                ans-=(z[r+1]-zr)*s;
            }
            else{
                ans+=zr*s;
                ans-=z[r+1]*t;
            }
        }
        else{
            if(z[r+1]<0){
                ans-=(z[r+1]-zr)*t;
            }
            else{
                ans+=zr*t;
                ans-=z[r+1]*s;
            }
        }
        cout<<ans<<endl;
    }

}
int main() {
    BBC
    ll tc = 1;
    //cin>>tc;
    while (tc--) {
        W2dNHK();
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60