Submission #1341936

#TimeUsernameProblemLanguageResultExecution timeMemory
1341936uranhishigFoehn Phenomena (JOI17_foehn_phenomena)C++20
100 / 100
355 ms7288 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long


signed main(){
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    vector<int> a(n + 1);
    vector<int> d(n + 1);
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
    } 
    for (int i = 1; i <= n; i++) {
        d[i] = a[i] - a[i - 1];
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (d[i] > 0) ans -= s * d[i];
        else ans -= t * d[i];
    }
    while(q--){
        int l, r, x;
        cin >> l >> r >> x;
        if (d[l] > 0){
            ans +=s*d[l];
        }
        else {
            ans += t*d[l];
        }
        d[l] += x;
        if (d[l] > 0){
            ans -= s *d[l];
        }
        else ans -= t * d[l];
        r++;
        if (r <= n) {
            if (d[r] > 0) ans += s * d[r];
            else ans += t * d[r];
            d[r] -= x;
            if (d[r] > 0) ans -= s * d[r];
            else ans -= t * d[r];
        }
        cout << ans << endl;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...