제출 #1273833

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1273833		warrenn	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	371 ms	7316 KiB

foehn_phenomena

// submit di https://oj.uz/problem/view/JOI17_foehn_phenomena
#include<bits/stdc++.h>
using namespace std;
#define int long long 

signed main(){
    int n,qu,s,t;
    cin>>n>>qu>>s>>t;
    int a[n+1];
    int diff[n+1];
    for(int q=0;q<=n;q++)cin>>a[q];
    int ans=0;

    for(int q=1;q<=n;q++){
        diff[q]=a[q-1]-a[q];
        if(diff[q]<0){
            ans+=diff[q]*s;
        }
        else{
            ans+=diff[q]*t;
        }
    }

    while(qu--){
        int l,r,x;
        cin>>l>>r>>x;
        if(diff[l]>0){
            ans-=diff[l]*t;
        }
        else{
            ans-=diff[l]*s;
        }
        diff[l]-=x;
        if(diff[l]>0){
            ans+=diff[l]*t;
        }
        else{
            ans+=diff[l]*s;
        }

        if(r<n){
            if(diff[r+1]>0){
                ans-=diff[r+1]*t;
            }
            else{
                ans-=diff[r+1]*s;
            }
            diff[r+1]+=x;
            if(diff[r+1]>0){
                ans+=diff[r+1]*t;
            }
            else{
                ans+=diff[r+1]*s;
            }
        }
        cout<<ans<<endl;
    }
    
}

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