Submission #482944

# Submission time Handle Problem Language Result Execution time Memory
482944 2021-10-27T02:51:03 Z jalsol Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
106 ms 10492 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];
int 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 3 ms 332 KB Output is correct
6 Correct 2 ms 376 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 328 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 372 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 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 96 ms 8588 KB Output is correct
2 Correct 94 ms 9276 KB Output is correct
3 Correct 90 ms 9852 KB Output is correct
4 Correct 106 ms 9432 KB Output is correct
5 Correct 90 ms 10364 KB Output is correct
6 Correct 86 ms 9420 KB Output is correct
7 Correct 86 ms 9412 KB Output is correct
8 Correct 92 ms 10300 KB Output is correct
9 Correct 94 ms 10492 KB Output is correct
10 Correct 90 ms 9232 KB Output is correct
11 Correct 86 ms 9340 KB Output is correct
12 Incorrect 81 ms 9852 KB Output isn't correct
13 Halted 0 ms 0 KB -
# 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 3 ms 332 KB Output is correct
6 Correct 2 ms 376 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 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 328 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 372 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 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 96 ms 8588 KB Output is correct
23 Correct 94 ms 9276 KB Output is correct
24 Correct 90 ms 9852 KB Output is correct
25 Correct 106 ms 9432 KB Output is correct
26 Correct 90 ms 10364 KB Output is correct
27 Correct 86 ms 9420 KB Output is correct
28 Correct 86 ms 9412 KB Output is correct
29 Correct 92 ms 10300 KB Output is correct
30 Correct 94 ms 10492 KB Output is correct
31 Correct 90 ms 9232 KB Output is correct
32 Correct 86 ms 9340 KB Output is correct
33 Incorrect 81 ms 9852 KB Output isn't correct
34 Halted 0 ms 0 KB -