oj.uz

Submission #900190

# Submission time Handle Problem Language Result Execution time Memory
900190 2024-01-07T20:44:16 Z aykhn Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 233 ms 16468 KB 
#include <bits/stdc++.h>

// author: aykhn

using namespace std;
typedef long long ll;

#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define int ll
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount

const int MXN = 2e5 + 5;

int n, sz = 1;
int q, s, t;
int st[4 * MXN], a[MXN];

void build(int l, int r, int x)
{
    if (l + 1 == r)
    {
        st[x] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, 2*x + 1), build(mid, r, 2*x + 2);
}
void add(int l, int r, int x, int lx, int rx, int val)
{
    if (l >= rx || r <= lx) return;
    if (l >= lx && r <= rx) 
    {
        st[x] += val;
        return;
    }
    int mid = (l + r) >> 1;
    add(l, mid, 2*x + 1, lx, rx, val), add(mid, r, 2*x + 2, lx, rx, val);
}
int get(int l, int r, int x, int ind)
{
    if (l + 1 == r) return st[x];
    int mid = (l + r) >> 1;
    if (ind < mid) return st[x] + get(l, mid, 2*x + 1, ind);
    else return st[x] + get(mid, r, 2*x + 2, ind);
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    n++;
    while (sz < n) sz <<= 1;
    int res = 0;
    for (int i = 0; i < n; i++) 
    {
        cin >> a[i];
        if (!i) continue;
        if (a[i - 1] < a[i]) res += (a[i - 1] - a[i]) * s;
        else res += (a[i - 1] - a[i]) * t;
    }
    build(0, sz, 0);
    while (q--)
    {
        int l, r, val;
        cin >> l >> r >> val;
        int a = get(0, sz, 0, l - 1), b = get(0, sz, 0, l), c = get(0, sz, 0, r), d = get(0, sz, 0, r + 1);
        if (a < b) res -= (a - b) * s;
        else res -= (a - b) * t;
        if (r + 1 < n && c < d) res -= (c - d) * s;
        else if (r + 1 < n) res -= (c - d) * t;
        add(0, sz, 0, l, r + 1, val);
        b = get(0, sz, 0, l), c = get(0, sz, 0, r);
        if (a < b) res += (a - b) * s;
        else res += (a - b) * t;
        if (r + 1 < n && c < d) res += (c - d) * s;
        else if (r + 1 < n) res += (c - d) * t;
        cout << res << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2524 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2600 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2580 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 13596 KB Output is correct
2 Correct 219 ms 14416 KB Output is correct
3 Correct 218 ms 14672 KB Output is correct
4 Correct 223 ms 14220 KB Output is correct
5 Correct 221 ms 15368 KB Output is correct
6 Correct 115 ms 14260 KB Output is correct
7 Correct 116 ms 14288 KB Output is correct
8 Correct 199 ms 15188 KB Output is correct
9 Correct 198 ms 15316 KB Output is correct
10 Correct 194 ms 14060 KB Output is correct
11 Correct 103 ms 14264 KB Output is correct
12 Correct 112 ms 14784 KB Output is correct
13 Correct 107 ms 15140 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2524 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2600 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2580 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 218 ms 13596 KB Output is correct
23 Correct 219 ms 14416 KB Output is correct
24 Correct 218 ms 14672 KB Output is correct
25 Correct 223 ms 14220 KB Output is correct
26 Correct 221 ms 15368 KB Output is correct
27 Correct 115 ms 14260 KB Output is correct
28 Correct 116 ms 14288 KB Output is correct
29 Correct 199 ms 15188 KB Output is correct
30 Correct 198 ms 15316 KB Output is correct
31 Correct 194 ms 14060 KB Output is correct
32 Correct 103 ms 14264 KB Output is correct
33 Correct 112 ms 14784 KB Output is correct
34 Correct 107 ms 15140 KB Output is correct
35 Correct 217 ms 13556 KB Output is correct
36 Correct 222 ms 14984 KB Output is correct
37 Correct 224 ms 15952 KB Output is correct
38 Correct 230 ms 15748 KB Output is correct
39 Correct 226 ms 15740 KB Output is correct
40 Correct 233 ms 16036 KB Output is correct
41 Correct 226 ms 15392 KB Output is correct
42 Correct 227 ms 15516 KB Output is correct
43 Correct 224 ms 14932 KB Output is correct
44 Correct 219 ms 15156 KB Output is correct
45 Correct 217 ms 15188 KB Output is correct
46 Correct 226 ms 16468 KB Output is correct
47 Correct 117 ms 15036 KB Output is correct
48 Correct 103 ms 14932 KB Output is correct
49 Correct 211 ms 14068 KB Output is correct
50 Correct 105 ms 14624 KB Output is correct
51 Correct 117 ms 15108 KB Output is correct
52 Correct 124 ms 14928 KB Output is correct