제출 #749915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
749915		Pring	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	122 ms	7288 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int, int> pii;
#define endl '\n'

const int MXN = 200005;
int n, q, s, t, a[MXN], d[MXN], ans;
int l, r, x;

inline int f(int id) {
    if (d[id] >= 0) return d[id] * s;
    else return d[id] * t; 
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cout.tie(0);
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        d[i] = a[i + 1] - a[i];
        ans -= f(i);
    }
    // for (int i = 0; i < n; i++) cout << d[i] << ' ';
    // cout << endl;
    // cout << ans << endl;
    while (q--) {
        cin >> l >> r >> x;
        l--;
        ans += f(l);
        if (r < n) ans += f(r);
        d[l] += x;
        d[r] -= x;
        ans -= f(l);
        if (r < n) ans -= f(r);
        // for (int i = 0; i < n; i++) cout << d[i] << ' ';
        // cout << endl;
        cout << ans << endl;
    }
    return 0;
}

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