oj.uz

Submission #854584

# Submission time Handle Problem Language Result Execution time Memory
854584 2023-09-28T06:12:56 Z ancuber1031 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 122 ms 9044 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int,int>
#define p_q priority_queue
#define pb push_back

struct BIT{
    vector<int> a;
    int sz;
    void init(int _n) {
        a.assign(_n+5,0);
        sz = _n;
    }
    void mdf(int p, int x) {
        while(p <= sz) {
            a[p] += x;
            p += p&-p;
        }
    }
    int val(int p) {
        int ans = 0;
        while(p) {
            ans += a[p];
            p -= p&-p;
        }
        return ans;
    }
} bit, ht;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, q, s, t;
    cin>>n>>q>>s>>t;
    bit.init(n+1);
    ht.init(n+1);
    vector<int> a(n+2);
    for (int i = 0; i <= n; ++i) {
        cin>>a[i];
        if (i) {
            ht.mdf(i,a[i]-a[i-1]);
            if (a[i] > a[i-1]) {
                bit.mdf(i,(a[i-1]-a[i])*s);
                //cout<<"p1"<<endl;
            } else if (a[i] < a[i-1]) {
                bit.mdf(i,(a[i-1]-a[i])*t);
                //cout<<"p2"<<endl;
            }
        }
    }
    cout<<endl;
    while(q--) {
        int l, r, x; cin>>l>>r>>x;
        r++;
        if (x > 0) {
            if (ht.val(l) < ht.val(l-1)) {
                if (ht.val(l)+x > ht.val(l-1)) {
                    bit.mdf(l,(ht.val(l-1)-ht.val(l))*(-t)+(ht.val(l)+x-ht.val(l-1))*(-s));
                    //cout<<"p3"<<endl;
                } else {
                    bit.mdf(l,x*(-t));
                    //cout<<"p4"<<endl;
                }
            } else {
                bit.mdf(l,x*(-s));
                //cout<<"p5"<<endl;
            }
            x = -x;
            if (ht.val(r) > ht.val(r-1)) {
                if (ht.val(r)+x < ht.val(r-1)) {
                    bit.mdf(r,(ht.val(r)-ht.val(r-1))*s+(ht.val(r)+x-ht.val(r-1))*(-t));
                    //cout<<"p6"<<endl;
                } else {
                    bit.mdf(r,-x*s);
                    //cout<<"p7"<<endl;
                }
            } else {
                bit.mdf(r,-x*t);
                //cout<<"p8"<<endl;
            }
        } else if (x < 0) {
            if (ht.val(l) > ht.val(l-1)) {
                if (ht.val(l)+x < ht.val(l-1)) {
                    bit.mdf(l,(ht.val(l)-ht.val(l-1))*s+(ht.val(l)+x-ht.val(l-1))*(-t));
                    //cout<<"p9"<<endl;
                } else {
                    bit.mdf(l,-x*s);
                    //cout<<"p10"<<endl;
                }
            } else {
                bit.mdf(l,-x*t);
                //cout<<"p11"<<endl;
            }
            x = -x;
            if (ht.val(r) < ht.val(r-1)) {
                if (ht.val(r)+x > ht.val(r-1)) {
                    bit.mdf(r,(ht.val(r-1)-ht.val(r))*(-t)+(ht.val(r)+x-ht.val(r-1))*(-s));
                    //cout<<"p12"<<endl;
                } else {
                    bit.mdf(r,x*(-t));
                    //cout<<"p13"<<endl;
                }
            } else {
                bit.mdf(r,x*(-s));
                //cout<<"p14"<<endl;
            }
        }
        x = -x;
        ht.mdf(l,x), ht.mdf(r,-x);
        
        //for (int i = 0; i <= n; ++i) cout<<ht.val(i)<<' '; cout<<endl;
        //for (int i = 1; i <= n; ++i) cout<<bit.val(i)-bit.val(i-1)<<' '; cout<<endl;
        
        cout<<bit.val(n)<<'\n';
    }
    
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 1 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 109 ms 6464 KB Output is correct
2 Correct 116 ms 7216 KB Output is correct
3 Correct 110 ms 7792 KB Output is correct
4 Correct 102 ms 6740 KB Output is correct
5 Correct 102 ms 7524 KB Output is correct
6 Correct 95 ms 8348 KB Output is correct
7 Correct 89 ms 8020 KB Output is correct
8 Correct 122 ms 7944 KB Output is correct
9 Correct 106 ms 8196 KB Output is correct
10 Correct 101 ms 6936 KB Output is correct
11 Correct 92 ms 8016 KB Output is correct
12 Correct 93 ms 8516 KB Output is correct
13 Correct 94 ms 9044 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 109 ms 6464 KB Output is correct
23 Correct 116 ms 7216 KB Output is correct
24 Correct 110 ms 7792 KB Output is correct
25 Correct 102 ms 6740 KB Output is correct
26 Correct 102 ms 7524 KB Output is correct
27 Correct 95 ms 8348 KB Output is correct
28 Correct 89 ms 8020 KB Output is correct
29 Correct 122 ms 7944 KB Output is correct
30 Correct 106 ms 8196 KB Output is correct
31 Correct 101 ms 6936 KB Output is correct
32 Correct 92 ms 8016 KB Output is correct
33 Correct 93 ms 8516 KB Output is correct
34 Correct 94 ms 9044 KB Output is correct
35 Correct 108 ms 6536 KB Output is correct
36 Correct 112 ms 7932 KB Output is correct
37 Correct 114 ms 8792 KB Output is correct
38 Correct 112 ms 8532 KB Output is correct
39 Correct 112 ms 8532 KB Output is correct
40 Correct 112 ms 8528 KB Output is correct
41 Correct 111 ms 8532 KB Output is correct
42 Correct 119 ms 8528 KB Output is correct
43 Correct 110 ms 7760 KB Output is correct
44 Correct 110 ms 8276 KB Output is correct
45 Correct 101 ms 8016 KB Output is correct
46 Correct 104 ms 8788 KB Output is correct
47 Correct 99 ms 8648 KB Output is correct
48 Correct 106 ms 9044 KB Output is correct
49 Correct 95 ms 7712 KB Output is correct
50 Correct 90 ms 8492 KB Output is correct
51 Correct 81 ms 8528 KB Output is correct
52 Correct 92 ms 8532 KB Output is correct