oj.uz

Submission #539210

# Submission time Handle Problem Language Result Execution time Memory
539210 2022-03-18T15:01:01 Z timreizin Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 155 ms 14636 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <cassert>
#include <numeric>

using namespace std;

using ll = long long;

struct BIT
{
    int n;
    vector<ll> tree;
    
    void update(int p, ll val)
    {
        for (;p < n; p |= p + 1) tree[p] += val;
    }
    
    BIT(vector<ll> a) : n((int)a.size())
    {
        tree.resize(n);
        for (int i = 0; i < n; ++i) update(i, a[i]);
    }
    
    ll get()
    {
        ll res = 0;
        for (int i = n - 1; i >= 0; i = (i & (i + 1)) - 1) res += tree[i];
        return res;
    }
    
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    ll s, t;
    cin >> n >> q >> s >> t;
    vector<ll> a(n);
    cin >> a.front();
    for (ll &i : a) cin >> i;
    adjacent_difference(a.begin(), a.end(), a.begin());
    vector<ll> help = a;
    for (ll &i : help)
    {
        if (i < 0) i *= -t;
        else i *= -s;
    }
    BIT st(help);
    while (q--)
    {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        //l - 1
        //r
        a[l - 1] += x;
        ll next = a[l - 1] * (a[l - 1] < 0 ? -t : -s);
        st.update(l - 1, next - help[l - 1]);
        help[l - 1] = next;
        if (r != n)
        {
            a[r] -= x;
            ll next = a[r] * (a[r] < 0 ? -t : -s);
            st.update(r, next - help[r]);
            help[r] = next;
        }
        cout << st.get() << '\n';
    }
    return 0;
}

/*
3 5 1 2
0 4 1 8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 452 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 384 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 316 KB Output is correct
21 Correct 0 ms 316 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 11844 KB Output is correct
2 Correct 129 ms 12428 KB Output is correct
3 Correct 127 ms 13024 KB Output is correct
4 Correct 127 ms 12360 KB Output is correct
5 Correct 139 ms 13648 KB Output is correct
6 Correct 114 ms 12600 KB Output is correct
7 Correct 103 ms 12596 KB Output is correct
8 Correct 155 ms 13356 KB Output is correct
9 Correct 115 ms 13664 KB Output is correct
10 Correct 133 ms 12472 KB Output is correct
11 Correct 95 ms 12460 KB Output is correct
12 Correct 96 ms 13228 KB Output is correct
13 Correct 91 ms 13356 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 452 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 384 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 316 KB Output is correct
21 Correct 0 ms 316 KB Output is correct
22 Correct 128 ms 11844 KB Output is correct
23 Correct 129 ms 12428 KB Output is correct
24 Correct 127 ms 13024 KB Output is correct
25 Correct 127 ms 12360 KB Output is correct
26 Correct 139 ms 13648 KB Output is correct
27 Correct 114 ms 12600 KB Output is correct
28 Correct 103 ms 12596 KB Output is correct
29 Correct 155 ms 13356 KB Output is correct
30 Correct 115 ms 13664 KB Output is correct
31 Correct 133 ms 12472 KB Output is correct
32 Correct 95 ms 12460 KB Output is correct
33 Correct 96 ms 13228 KB Output is correct
34 Correct 91 ms 13356 KB Output is correct
35 Correct 139 ms 11968 KB Output is correct
36 Correct 126 ms 13416 KB Output is correct
37 Correct 146 ms 14136 KB Output is correct
38 Correct 118 ms 14000 KB Output is correct
39 Correct 139 ms 14008 KB Output is correct
40 Correct 120 ms 14036 KB Output is correct
41 Correct 125 ms 13800 KB Output is correct
42 Correct 139 ms 14036 KB Output is correct
43 Correct 130 ms 13184 KB Output is correct
44 Correct 150 ms 13612 KB Output is correct
45 Correct 111 ms 13612 KB Output is correct
46 Correct 143 ms 14636 KB Output is correct
47 Correct 99 ms 13260 KB Output is correct
48 Correct 120 ms 13312 KB Output is correct
49 Correct 102 ms 12200 KB Output is correct
50 Correct 95 ms 13076 KB Output is correct
51 Correct 112 ms 13372 KB Output is correct
52 Correct 95 ms 13216 KB Output is correct