Submission #482945

# Submission time Handle Problem Language Result Execution time Memory
482945 2021-10-27T02:51:28 Z jalsol Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
101 ms 12356 KB
#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';
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 86 ms 4036 KB Output is correct
2 Correct 96 ms 4700 KB Output is correct
3 Correct 88 ms 5352 KB Output is correct
4 Correct 84 ms 4400 KB Output is correct
5 Correct 89 ms 5196 KB Output is correct
6 Correct 74 ms 5580 KB Output is correct
7 Correct 73 ms 5480 KB Output is correct
8 Correct 87 ms 5540 KB Output is correct
9 Correct 87 ms 5800 KB Output is correct
10 Correct 95 ms 4548 KB Output is correct
11 Correct 76 ms 5580 KB Output is correct
12 Correct 77 ms 6028 KB Output is correct
13 Correct 75 ms 11072 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 86 ms 4036 KB Output is correct
23 Correct 96 ms 4700 KB Output is correct
24 Correct 88 ms 5352 KB Output is correct
25 Correct 84 ms 4400 KB Output is correct
26 Correct 89 ms 5196 KB Output is correct
27 Correct 74 ms 5580 KB Output is correct
28 Correct 73 ms 5480 KB Output is correct
29 Correct 87 ms 5540 KB Output is correct
30 Correct 87 ms 5800 KB Output is correct
31 Correct 95 ms 4548 KB Output is correct
32 Correct 76 ms 5580 KB Output is correct
33 Correct 77 ms 6028 KB Output is correct
34 Correct 75 ms 11072 KB Output is correct
35 Correct 93 ms 9624 KB Output is correct
36 Correct 90 ms 11028 KB Output is correct
37 Correct 93 ms 11876 KB Output is correct
38 Correct 97 ms 11588 KB Output is correct
39 Correct 90 ms 11572 KB Output is correct
40 Correct 91 ms 11660 KB Output is correct
41 Correct 100 ms 11488 KB Output is correct
42 Correct 101 ms 11548 KB Output is correct
43 Correct 93 ms 10840 KB Output is correct
44 Correct 94 ms 11172 KB Output is correct
45 Correct 89 ms 11232 KB Output is correct
46 Correct 90 ms 12356 KB Output is correct
47 Correct 78 ms 10808 KB Output is correct
48 Correct 82 ms 11000 KB Output is correct
49 Correct 81 ms 9820 KB Output is correct
50 Correct 81 ms 10684 KB Output is correct
51 Correct 76 ms 11016 KB Output is correct
52 Correct 76 ms 10808 KB Output is correct