제출 #482945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482945		jalsol	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	101 ms	12356 KiB

foehn_phenomena

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 2e5 + 5;

int n, nq, incr, decr;
int a[maxn];
ll diff[maxn];

ll change(ll x) {
    if (x < 0) {
        return x * incr;
    } else {
        return x * decr;
    }
}

signed main() {
    cin >> n >> nq >> incr >> decr;
    For (i, 0, n) cin >> a[i];

    ll sum = 0;

    For (i, 1, n) {
        diff[i] = a[i - 1] - a[i];
        sum += change(diff[i]);
    }

    Rep (_, nq) {
        int l, r, x; cin >> l >> r >> x;

        {
            sum -= change(diff[l]);
            diff[l] -= x;
            sum += change(diff[l]);
        }

        if (r < n) {
            sum -= change(diff[r + 1]);
            diff[r + 1] += x;
            sum += change(diff[r + 1]);
        }

        cout << sum << '\n';
    }
}

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