제출 #987083

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987083		vyshniak_n	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	86 ms	13396 KiB

foehn_phenomena

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 3e5 + 10;
const ll mod = 1e9 + 7;
const ll K = 600;
const ll LOG = 8;



void solve() {
    ll n, q, s, t;
    cin >> n >> q >> s >> t;

    vector <ll> a(n + 1);
    for (ll i = 0; i <= n; i++)
        cin >> a[i];

    vector <ll> b(n + 1);
    for (ll i = 1; i <= n; i++)
        b[i] = a[i] - a[i - 1];

    auto val = [&](ll x) -> ll {
        if (x > 0) return -abs(x) * s;
        else return abs(x) * t;
    };

    ll ans = 0;
    for (ll i = 1; i <= n; i++)
        ans += val(b[i]);

    while (q--) {
        ll l, r, x;
        cin >> l >> r >> x;

        ans -= val(b[l]);
        b[l] += x;
        ans += val(b[l]);

        if (r != n) {
            ans -= val(b[r + 1]);
            b[r + 1] -= x;
            ans += val(b[r + 1]);
        }

        cout << ans << el;
    }
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

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