oj.uz

Submission #854580

# Submission time Handle Problem Language Result Execution time Memory
854580 2023-09-28T06:01:08 Z BrineTw Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 116 ms 7344 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
 
#define debug(x) cerr << #x << ' ' << x << '\n'
#define endl '\n'
 
using namespace std;
 
const int M = 1e9 + 7;
typedef long long ll;
 
struct BIT {
    int N;
    vector<ll> v;
 
    BIT(int N): N(N + 1), v(N + 2) {}
    
    inline int lb(int x) {
        return x & -x;
    }
 
    void update(int i, ll dx) {
        for (; i <= N; i += lb(i)) v[i] += dx;
    }
    
    ll query(int i) {
        ll ans = 0;
        for (; i; i -= lb(i)) ans += v[i];
        return ans;
    }
};
 
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
    int N, Q, S, T;
    cin >> N >> Q >> S >> T;
 
    vector<ll> h(N + 1);
    for (auto& n: h) cin >> n;
    
    BIT bit(N);
    ll current = 0;
    for (int i = 1; i <= N; i++) {
        if (h[i] > h[i - 1]) {
            current -= (h[i] - h[i - 1]) * S;
        } else {
            current -= (h[i] - h[i - 1]) * T;
        }
        bit.update(i, h[i] - h[i - 1]);
    }
 
//    for (auto& n: bit.v) cerr << n << " \n"[&n == &bit.v.back()];
 
    for (int i = 0; i <= N; i++) {
    //    cerr << bit.query(i) << ' ';
    }
  //  cerr << '\n';
    
    ll l, r, dy;
    for (int i = 0; i < Q; i++) {
        cin >> l >> r >> dy;
        
        ll h1, h2, h3, h4;
        h1 = bit.query(l - 1);
        h2 = bit.query(l);
        h3 = bit.query(r);
        h4 = bit.query(r + 1);
 
        if (h2 > h1) {
            current += (h2 - h1) * S;
        } else {
            current += (h2 - h1) * T;
        }
 
        if (r != N && h4 > h3) {
            current += (h4 - h3) * S;
        } else if (r != N && h4 <= h3) {
            current += (h4 - h3) * T;
        }
 
        bit.update(l, dy);
        bit.update(r + 1, -dy);
        
        h1 = bit.query(l - 1);
        h2 = bit.query(l);
        h3 = bit.query(r);
        h4 = bit.query(r + 1);
 
        current -= (h2 > h1 ? S : T) * (h2 - h1);
        if (r != N) current -= (h4 > h3 ? S : T) * (h4 - h3); 
        
        cout << current << '\n';
    }
 
    return 0;   
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 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 101 ms 5012 KB Output is correct
2 Correct 115 ms 5488 KB Output is correct
3 Correct 103 ms 6224 KB Output is correct
4 Correct 95 ms 5200 KB Output is correct
5 Correct 116 ms 5968 KB Output is correct
6 Correct 78 ms 6392 KB Output is correct
7 Correct 76 ms 6440 KB Output is correct
8 Correct 115 ms 6480 KB Output is correct
9 Correct 100 ms 6620 KB Output is correct
10 Correct 96 ms 5460 KB Output is correct
11 Correct 70 ms 6436 KB Output is correct
12 Correct 78 ms 7032 KB Output is correct
13 Correct 72 ms 7304 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 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 101 ms 5012 KB Output is correct
23 Correct 115 ms 5488 KB Output is correct
24 Correct 103 ms 6224 KB Output is correct
25 Correct 95 ms 5200 KB Output is correct
26 Correct 116 ms 5968 KB Output is correct
27 Correct 78 ms 6392 KB Output is correct
28 Correct 76 ms 6440 KB Output is correct
29 Correct 115 ms 6480 KB Output is correct
30 Correct 100 ms 6620 KB Output is correct
31 Correct 96 ms 5460 KB Output is correct
32 Correct 70 ms 6436 KB Output is correct
33 Correct 78 ms 7032 KB Output is correct
34 Correct 72 ms 7304 KB Output is correct
35 Correct 100 ms 5084 KB Output is correct
36 Correct 105 ms 6368 KB Output is correct
37 Correct 105 ms 7248 KB Output is correct
38 Correct 106 ms 7116 KB Output is correct
39 Correct 106 ms 6996 KB Output is correct
40 Correct 105 ms 7344 KB Output is correct
41 Correct 104 ms 6896 KB Output is correct
42 Correct 106 ms 7112 KB Output is correct
43 Correct 101 ms 6264 KB Output is correct
44 Correct 104 ms 6736 KB Output is correct
45 Correct 97 ms 6484 KB Output is correct
46 Correct 100 ms 7200 KB Output is correct
47 Correct 76 ms 6992 KB Output is correct
48 Correct 84 ms 7256 KB Output is correct
49 Correct 92 ms 6276 KB Output is correct
50 Correct 69 ms 6996 KB Output is correct
51 Correct 80 ms 7096 KB Output is correct
52 Correct 75 ms 6992 KB Output is correct