oj.uz

Submission #856370

# Submission time Handle Problem Language Result Execution time Memory
856370 2023-10-03T09:16:12 Z Namviet2704 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 221 ms 26972 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 2e5 + 5;

int n, q, s, t;
ll a[N];
struct st
{
    ll left, right, val;
    ll lazy;
} nodes[N * 4];

void down(int id)
{
    ll t = nodes[id].lazy;

    nodes[id * 2].lazy += t;
    nodes[id * 2].left += t;
    nodes[id * 2].right += t;

    nodes[id * 2 + 1].lazy += t;
    nodes[id * 2 + 1].left += t;
    nodes[id * 2 + 1].right += t;

    nodes[id].lazy = 0;
}

st merge(st A, st B)
{
    if (A.right < B.left)
        A.val += B.val - (B.left - A.right) * s;
    else
        A.val += B.val + (A.right - B.left) * t;
    A.right = B.right;
    return A;
}

void build(int id, int l, int r)
{
    if (l == r)
    {
        nodes[id].left = nodes[id].right = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
    nodes[id] = merge(nodes[id * 2], nodes[id * 2 + 1]);
}

void update(int id, int l, int r, int u, int v, ll val)
{
    // cout << nodes[3].lazy << '\n';
    if (v < l || r < u)
        return;

    if (u <= l && r <= v)
    {
        nodes[id].left += val;
        nodes[id].right += val;
        // cout << id << " " << l << " " << r << " " << nodes[id].lazy << "haha" << '\n';
        nodes[id].lazy += val;
        return;
    }
    int mid = (l + r) / 2;

    down(id);

    update(id * 2, l, mid, u, v, val);
    update(id * 2 + 1, mid + 1, r, u, v, val);
    ll h = nodes[id].lazy;
    nodes[id] = merge(nodes[id * 2], nodes[id * 2 + 1]);
    nodes[id].lazy = h;
}

int main()
{
    // freopen(task".inp", "r", stdin);
    // freopen(task".out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++)
        cin >> a[i];
    build(1, 0, n);
    // cout << nodes[3].lazy << '\n';
    for (int i = 1; i <= q; i++)
    {
        int x, y;
        ll val;
        cin >> x >> y >> val;
        update(1, 0, n, x, y, val);
        cout << nodes[1].val << '\n';
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 644 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 20052 KB Output is correct
2 Correct 202 ms 20604 KB Output is correct
3 Correct 200 ms 21076 KB Output is correct
4 Correct 185 ms 20276 KB Output is correct
5 Correct 196 ms 21004 KB Output is correct
6 Correct 112 ms 21380 KB Output is correct
7 Correct 111 ms 21516 KB Output is correct
8 Correct 179 ms 21332 KB Output is correct
9 Correct 173 ms 21844 KB Output is correct
10 Correct 181 ms 20520 KB Output is correct
11 Correct 117 ms 21484 KB Output is correct
12 Correct 109 ms 21844 KB Output is correct
13 Correct 106 ms 22356 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 644 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 198 ms 20052 KB Output is correct
23 Correct 202 ms 20604 KB Output is correct
24 Correct 200 ms 21076 KB Output is correct
25 Correct 185 ms 20276 KB Output is correct
26 Correct 196 ms 21004 KB Output is correct
27 Correct 112 ms 21380 KB Output is correct
28 Correct 111 ms 21516 KB Output is correct
29 Correct 179 ms 21332 KB Output is correct
30 Correct 173 ms 21844 KB Output is correct
31 Correct 181 ms 20520 KB Output is correct
32 Correct 117 ms 21484 KB Output is correct
33 Correct 109 ms 21844 KB Output is correct
34 Correct 106 ms 22356 KB Output is correct
35 Correct 202 ms 20048 KB Output is correct
36 Correct 201 ms 21404 KB Output is correct
37 Correct 221 ms 22612 KB Output is correct
38 Correct 206 ms 22096 KB Output is correct
39 Correct 198 ms 21988 KB Output is correct
40 Correct 216 ms 22340 KB Output is correct
41 Correct 198 ms 21840 KB Output is correct
42 Correct 211 ms 22096 KB Output is correct
43 Correct 207 ms 21332 KB Output is correct
44 Correct 201 ms 21584 KB Output is correct
45 Correct 193 ms 21836 KB Output is correct
46 Correct 191 ms 22100 KB Output is correct
47 Correct 114 ms 26628 KB Output is correct
48 Correct 103 ms 26700 KB Output is correct
49 Correct 183 ms 25672 KB Output is correct
50 Correct 119 ms 26620 KB Output is correct
51 Correct 114 ms 26972 KB Output is correct
52 Correct 146 ms 26704 KB Output is correct