Submission #654061

#	Time	Username	Problem	Language	Result	Execution time	Memory
654061		sofija6	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	10 / 100	109 ms	10620 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
ll a[MAXN];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,q,s,t,ans=0,l,r,x;
    cin >> n >> q >> s >> t;
    for (ll i=0;i<=n;i++)
    {
        cin >> a[i];
        if (i)
        {
            if (a[i]>a[i-1])
                ans-=s*(a[i]-a[i-1]);
            else
                ans+=t*(a[i-1]-a[i]);
        }
    }
    while (q--)
    {
        cin >> l >> r >> x;
        if (l && a[l]>a[l-1])
            ans+=s*(a[l]-a[l-1]);
        if (l && a[l]<=a[l-1])
            ans-=t*(a[l-1]-a[l]);
        r++;
        if (r<=n && a[r]>a[r-1])
            ans+=s*(a[r]-a[r-1]);
        if (r<=n && a[r]<=a[r-1])
            ans-=t*(a[r-1]-a[r]);
        a[l]+=x;
        if (r-1!=l)
            a[r-1]+=x;
        if (l && a[l]>a[l-1])
            ans-=s*(a[l]-a[l-1]);
        if (l && a[l]<=a[l-1])
            ans+=t*(a[l-1]-a[l]);
        if (r<=n && a[r]>a[r-1])
            ans-=s*(a[r]-a[r-1]);
        if (r<=n && a[r]<=a[r-1])
            ans+=t*(a[r-1]-a[r]);
        cout << ans << "\n";
    }
    return 0;
}

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