oj.uz

Submission #629050

# Submission time Handle Problem Language Result Execution time Memory
629050 2022-08-14T06:12:47 Z boris_mihov Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 420 ms 35756 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 200000 + 10;

llong n, q, s, t;
int a[MAXN];

struct Node
{
    llong left, right;
    llong sum, lazy;

    Node()
    {
        left = right = sum = lazy = 0;
    }

} tree[4*MAXN];

Node combine(Node left, Node right)
{
    Node res;
    res.left = left.left;
    res.right = right.right;
    res.sum = left.sum + right.sum;
    if (left.right <= right.left) res.sum -= s * (right.left - left.right);
    else res.sum += t * (left.right - right.left);
    return res;
}

void build(int l, int r, int node)
{
    if (l == r)
    {
        tree[node].left = a[l];
        tree[node].right = a[l];
        tree[node].lazy = 0;
        tree[node].sum = 0;
        return;
    }

    int mid = (l + r) / 2;
    build(l, mid, 2*node);
    build(mid + 1, r, 2*node + 1);
    tree[node] = combine(tree[2*node], tree[2*node + 1]);
}

void push(int node, int l, int r)
{
    if (tree[node].lazy == 0) return;

    tree[node].left += tree[node].lazy;
    tree[node].right += tree[node].lazy;
    if (l < r)
    {
        tree[2*node].lazy += tree[node].lazy;
        tree[2*node + 1].lazy += tree[node].lazy;
    }

    tree[node].lazy = 0;
}

void update(int l, int r, int node, int queryL, int queryR, int queryVal)
{
    push(node, l, r);
    if (queryR <  l || r <  queryL) return;
    if (queryL <= l && r <= queryR)
    {
        tree[node].lazy = queryVal;
        push(node, l, r);
        return;
    }

    int mid = (l + r) / 2;
    update(l, mid, 2*node, queryL, queryR, queryVal);
    update(mid + 1, r, 2*node + 1, queryL, queryR, queryVal);
    tree[node] = combine(tree[2*node], tree[2*node + 1]);
}

void solve()
{
    int l, r, value;
    build(0, n, 1);
    for (int i = 1 ; i <= q ; ++i)
    {
        std::cin >> l >> r >> value;
        update(0, n, 1, l, r, value);
        std::cout << tree[1].sum << '\n';
    }
}

void read()
{
    std::cin >> n >> q >> s >> t;
    for (int i = 0 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

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

int main()
{
    fastIO();
    read();
    solve();

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25428 KB Output is correct
2 Correct 12 ms 25376 KB Output is correct
3 Correct 12 ms 25512 KB Output is correct
4 Correct 12 ms 25428 KB Output is correct
5 Correct 14 ms 25376 KB Output is correct
6 Correct 15 ms 25452 KB Output is correct
7 Correct 13 ms 25428 KB Output is correct
8 Correct 12 ms 25416 KB Output is correct
9 Correct 13 ms 25364 KB Output is correct
10 Correct 12 ms 25388 KB Output is correct
11 Correct 12 ms 25364 KB Output is correct
12 Correct 12 ms 25476 KB Output is correct
13 Correct 12 ms 25432 KB Output is correct
14 Correct 13 ms 25392 KB Output is correct
15 Correct 13 ms 25516 KB Output is correct
16 Correct 13 ms 25444 KB Output is correct
17 Correct 13 ms 25428 KB Output is correct
18 Correct 13 ms 25384 KB Output is correct
19 Correct 13 ms 25300 KB Output is correct
20 Correct 11 ms 25380 KB Output is correct
21 Correct 10 ms 25260 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 32968 KB Output is correct
2 Correct 319 ms 33544 KB Output is correct
3 Correct 304 ms 34200 KB Output is correct
4 Correct 420 ms 33604 KB Output is correct
5 Correct 360 ms 34852 KB Output is correct
6 Correct 156 ms 33708 KB Output is correct
7 Correct 153 ms 33736 KB Output is correct
8 Correct 262 ms 34456 KB Output is correct
9 Correct 271 ms 34792 KB Output is correct
10 Correct 268 ms 33544 KB Output is correct
11 Correct 170 ms 33700 KB Output is correct
12 Correct 155 ms 34368 KB Output is correct
13 Correct 140 ms 34560 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25428 KB Output is correct
2 Correct 12 ms 25376 KB Output is correct
3 Correct 12 ms 25512 KB Output is correct
4 Correct 12 ms 25428 KB Output is correct
5 Correct 14 ms 25376 KB Output is correct
6 Correct 15 ms 25452 KB Output is correct
7 Correct 13 ms 25428 KB Output is correct
8 Correct 12 ms 25416 KB Output is correct
9 Correct 13 ms 25364 KB Output is correct
10 Correct 12 ms 25388 KB Output is correct
11 Correct 12 ms 25364 KB Output is correct
12 Correct 12 ms 25476 KB Output is correct
13 Correct 12 ms 25432 KB Output is correct
14 Correct 13 ms 25392 KB Output is correct
15 Correct 13 ms 25516 KB Output is correct
16 Correct 13 ms 25444 KB Output is correct
17 Correct 13 ms 25428 KB Output is correct
18 Correct 13 ms 25384 KB Output is correct
19 Correct 13 ms 25300 KB Output is correct
20 Correct 11 ms 25380 KB Output is correct
21 Correct 10 ms 25260 KB Output is correct
22 Correct 301 ms 32968 KB Output is correct
23 Correct 319 ms 33544 KB Output is correct
24 Correct 304 ms 34200 KB Output is correct
25 Correct 420 ms 33604 KB Output is correct
26 Correct 360 ms 34852 KB Output is correct
27 Correct 156 ms 33708 KB Output is correct
28 Correct 153 ms 33736 KB Output is correct
29 Correct 262 ms 34456 KB Output is correct
30 Correct 271 ms 34792 KB Output is correct
31 Correct 268 ms 33544 KB Output is correct
32 Correct 170 ms 33700 KB Output is correct
33 Correct 155 ms 34368 KB Output is correct
34 Correct 140 ms 34560 KB Output is correct
35 Correct 338 ms 33124 KB Output is correct
36 Correct 321 ms 34528 KB Output is correct
37 Correct 332 ms 35332 KB Output is correct
38 Correct 324 ms 35176 KB Output is correct
39 Correct 330 ms 35148 KB Output is correct
40 Correct 358 ms 35236 KB Output is correct
41 Correct 314 ms 34964 KB Output is correct
42 Correct 318 ms 35076 KB Output is correct
43 Correct 345 ms 34332 KB Output is correct
44 Correct 328 ms 34668 KB Output is correct
45 Correct 340 ms 34700 KB Output is correct
46 Correct 306 ms 35756 KB Output is correct
47 Correct 175 ms 34340 KB Output is correct
48 Correct 148 ms 34420 KB Output is correct
49 Correct 313 ms 33408 KB Output is correct
50 Correct 165 ms 34188 KB Output is correct
51 Correct 158 ms 34540 KB Output is correct
52 Correct 207 ms 34464 KB Output is correct