Submission #746509

#	Time	Username	Problem	Language	Result	Execution time	Memory
746509		Nelt	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	121 ms	13060 KiB

foehn_phenomena

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, q, s, t;
    cin >> n >> q >> s >> t;
    t = -t;
    s = -s;
    ll a[n + 1], b[n];
    ll ans = 0;
    for (ll i = 0; i <= n; i++)
        cin >> a[i];
    for (ll i = 0; i < n; i++)
        b[i] = a[i + 1] - a[i], ans += (b[i] < 0 ? b[i] * t : b[i] * s);
    while (q--)
    {
        ll l, r, x;
        cin >> l >> r >> x;
        l--;
        if (r < n)
            ans -= (b[r] < 0 ? b[r] * t : b[r] * s), b[r] -= x, ans += (b[r] < 0 ? b[r] * t : b[r] * s);
        ans -= (b[l] < 0 ? b[l] * t : b[l] * s), b[l] += x, ans += (b[l] < 0 ? b[l] * t : b[l] * s);
        cout << ans << endl;
    }
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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