oj.uz

Submission #837573

# Submission time Handle Problem Language Result Execution time Memory
837573 2023-08-25T12:23:32 Z borisAngelov Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 205 ms 14708 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 200005;

int n, q;
long long s, t;

int a[maxn];
long long delta[maxn];

struct state
{
    long long positive_sum; // multiply by s
    long long negative_sum; // multiply by t
};

struct segment_tree
{
    state tree[4 * maxn];

    state combine(const state left_child, const state right_child)
    {
        state result;

        result.positive_sum = left_child.positive_sum + right_child.positive_sum;
        result.negative_sum = left_child.negative_sum + right_child.negative_sum;

        return result;
    }

    void build(int node, int l, int r)
    {
        if (l == r)
        {
            if (delta[l] < 0)
            {
                tree[node].negative_sum = delta[l];
                tree[node].positive_sum = 0;
            }
            else
            {
                tree[node].positive_sum = delta[l];
                tree[node].negative_sum = 0;
            }

            return;
        }

        int mid = (l + r) / 2;

        build(2 * node, l, mid);
        build(2 * node + 1, mid + 1, r);

        tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
    }

    void update(int node, int l, int r, int pos, long long val)
    {
        if (l == r)
        {
            if (val < 0)
            {
                tree[node].negative_sum = val;
                tree[node].positive_sum = 0;
            }
            else
            {
                tree[node].positive_sum = val;
                tree[node].negative_sum = 0;
            }

            return;
        }

        int mid = (l + r) / 2;

        if (pos <= mid)
        {
            update(2 * node, l, mid, pos, val);
        }
        else
        {
            update(2 * node + 1, mid + 1, r, pos, val);
        }

        tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
    }

    void build()
    {
        build(1, 1, n);
    }

    void update(int pos, long long val)
    {
        update(1, 1, n, pos, val);
    }
};

segment_tree tree;

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> q >> s >> t;

    for (int i = 1; i <= n + 1; ++i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= n; ++i)
    {
        delta[i] = a[i] - a[i + 1];
    }

    tree.build();

    for (int i = 1; i <= q; ++i)
    {
        int l, r, val;
        cin >> l >> r >> val;

        if (l != 0)
        {
            delta[l] -= val;
            tree.update(l, delta[l]);
        }

        if (r != n)
        {
            delta[r + 1] += val;
            tree.update(r + 1, delta[r + 1]);
        }

        cout << tree.tree[1].negative_sum * s + tree.tree[1].positive_sum * t << "\n";
    }

    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 12356 KB Output is correct
2 Correct 177 ms 12892 KB Output is correct
3 Correct 173 ms 13488 KB Output is correct
4 Correct 160 ms 12720 KB Output is correct
5 Correct 144 ms 13328 KB Output is correct
6 Correct 79 ms 13764 KB Output is correct
7 Correct 80 ms 13780 KB Output is correct
8 Correct 161 ms 13748 KB Output is correct
9 Correct 135 ms 14120 KB Output is correct
10 Correct 131 ms 12808 KB Output is correct
11 Correct 88 ms 13776 KB Output is correct
12 Correct 79 ms 14156 KB Output is correct
13 Correct 81 ms 14708 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 159 ms 12356 KB Output is correct
23 Correct 177 ms 12892 KB Output is correct
24 Correct 173 ms 13488 KB Output is correct
25 Correct 160 ms 12720 KB Output is correct
26 Correct 144 ms 13328 KB Output is correct
27 Correct 79 ms 13764 KB Output is correct
28 Correct 80 ms 13780 KB Output is correct
29 Correct 161 ms 13748 KB Output is correct
30 Correct 135 ms 14120 KB Output is correct
31 Correct 131 ms 12808 KB Output is correct
32 Correct 88 ms 13776 KB Output is correct
33 Correct 79 ms 14156 KB Output is correct
34 Correct 81 ms 14708 KB Output is correct
35 Correct 177 ms 12512 KB Output is correct
36 Correct 205 ms 13860 KB Output is correct
37 Correct 157 ms 14608 KB Output is correct
38 Correct 188 ms 14404 KB Output is correct
39 Correct 188 ms 14456 KB Output is correct
40 Correct 178 ms 14424 KB Output is correct
41 Correct 174 ms 14300 KB Output is correct
42 Correct 180 ms 14312 KB Output is correct
43 Correct 152 ms 13632 KB Output is correct
44 Correct 170 ms 13988 KB Output is correct
45 Correct 164 ms 13852 KB Output is correct
46 Correct 157 ms 14512 KB Output is correct
47 Correct 80 ms 14480 KB Output is correct
48 Correct 91 ms 14708 KB Output is correct
49 Correct 145 ms 13596 KB Output is correct
50 Correct 89 ms 14352 KB Output is correct
51 Correct 81 ms 14460 KB Output is correct
52 Correct 93 ms 14448 KB Output is correct