제출 #407207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407207		FEDIKUS	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	131 ms	11524 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,ll) sort(a.begin(),a.end(),greater<ll>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll,ll> pll;
typedef string str;

const ll maxn=2e5+10;

ll niz[maxn];

ll sta(ll a,ll s,ll t){
    if(a>0) return a*s;
    return a*t;
}

void solve(){
    ll n,q,s,t;
    cin>>n>>q>>s>>t;
    ll prosli=0;
    cin>>prosli;
    ll res=0;
    for(ll i=1;i<=n;i++){
        ll a;
        cin>>a;
        niz[i]=a-prosli;
        res-=sta(niz[i],s,t);
        prosli=a;
    }
    //cout<<res<<"\n";
    while(q--){
        ll l,r,x;
        cin>>l>>r>>x;
        res+=sta(niz[l],s,t);
        if(r<n) res+=sta(niz[r+1],s,t);
        niz[l]+=x;
        if(r<n) niz[r+1]-=x;
        res-=sta(niz[l],s,t);
        if(r<n) res-=sta(niz[r+1],s,t);
        cout<<res<<"\n";
    }
}

int main(){
    ios;
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

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