제출 #126696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126696		toonewbie	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	148 ms	7728 KiB

foehn_phenomena

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

#define ll long long
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(v) (v).begin(),(v).end()

using namespace std;

const int N = 200005;

int n, q, s, t;
int a[N];
ll b[N];

ll get(ll x) {
    if (x < 0) return x * s;
    else return x * t;
}

int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
    }
    ll res = 0;
    for (int i = 1; i <= n; i++) {
        b[i] = -a[i] + a[i - 1];
        res += get(b[i]);
    }
    while(q--) {
        int l, r, x;
        cin >> l >> r >> x;
        res -= get(b[l]);
        b[l] -= x;
        res += get(b[l]);
        if (r < n) {
            res -= get(b[r + 1]);
            b[r + 1] += x;
            res += get(b[r + 1]);
        }
        cout << res << endl;
    }
    return 0;
}

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