oj.uz

Submission #993157

# Submission time Handle Problem Language Result Execution time Memory
993157 2024-06-05T11:14:22 Z Nu_Pogodi Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 595 ms 17236 KB 
#include<bits/stdc++.h>
#define int long long
#define fr first
#define sc second
#define pow powl
using namespace std;
const int MAX = 2e5+5;
const int MOD = 1e9+7;
const int MIX = 1e15+9;
int cold,hot,sum=0;
int bl[MAX];
struct tree{
    int sz=1;
    vector<int> vec;
    void sout(){
        for(auto i : vec){
            cout<<i<<' ';
        }
    }
    void full(int n){
        while(sz<n){
            sz*=2;
        }
        vec.assign(sz*2-1,0);
    }
    void add(int L, int R, int v){
        add(L, R, v, 0, sz-1, 0);
    }
    void add(int L, int R, int v, int lr, int rl, int x){
        if(lr>=L && rl<=R){
            vec[x]+=v;
            return;
        }
        if(rl<L || lr>R){
            return;
        }
        int mid=(rl+lr)/2;
        add(L, R, v, mid+(rl+lr)%2, rl, x*2+2);
        add(L, R, v, lr, mid, x*2+1);
    }
    int take(int ps){
        return take(ps, 0, sz, 0, 0);
    }
    int take(int ps, int lr, int rl, int x, int op){
        if(rl-lr==1){
            return vec[x]+op;
        }
        int mid=(rl+lr)/2;
        if(mid<=ps){
            return take(ps, mid+(rl+lr)%2, rl, x*2+2, op+vec[x]);
        }
        else{
            return take(ps, lr, mid, x*2+1, op+vec[x]);
        }
    }
};
void solve(){
    tree tr;
    int n,q;
    cin>>n>>q>>cold>>hot;
    tr.full(n+1);
    int a[n+1];
    for(int i=0;i<=n;i++){
        cin>>a[i];
        tr.add(i,i,a[i]);
    }
    for(int i=1;i<=n;i++){
        if(a[i]>a[i-1]){
            sum-=(a[i]-a[i-1])*cold;
            bl[i-1]-=(a[i]-a[i-1])*cold;
        }
        else{
            sum+=(a[i-1]-a[i])*hot;
            bl[i-1]=(a[i-1]-a[i])*hot;
        }
    }
    // cout<<sum<<endl;
    // tr.sout();
    while(q--){
        int l, r, u;
        cin>>l>>r>>u;
        tr.add(l, r, u);
        if(l!=0){
            int x1=tr.take(l-1),x2=tr.take(l);
            // cout<<x1<<' '<<x2<<' ';
            sum-=bl[l-1];
            if(x2>x1){
                bl[l-1]=-(x2-x1)*cold;
            }
            else{
                bl[l-1]=(x1-x2)*hot;
            }
            sum+=bl[l-1];
        }
        if(r!=n){
            int x1=tr.take(r),x2=tr.take(r+1);
            // cout<<x1<<' '<<x2<<' ';
            sum-=bl[r];
            if(x2>x1){
                bl[r]=-(x2-x1)*cold;
            }
            else{
                bl[r]=(x1-x2)*hot;
            }
            sum+=bl[r];
        }
        cout<<sum<<endl;
    }

}
signed main()
{
    int t=1;
    // cin>>t;
    while(t --){
        solve();
        // cout<<endl;    
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 580 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 5 ms 564 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 5 ms 560 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 0 ms 444 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 528 ms 14452 KB Output is correct
2 Correct 587 ms 15056 KB Output is correct
3 Correct 595 ms 15508 KB Output is correct
4 Correct 564 ms 14928 KB Output is correct
5 Correct 567 ms 16208 KB Output is correct
6 Correct 462 ms 15188 KB Output is correct
7 Correct 424 ms 15048 KB Output is correct
8 Correct 589 ms 16208 KB Output is correct
9 Correct 544 ms 16212 KB Output is correct
10 Correct 550 ms 14928 KB Output is correct
11 Correct 454 ms 14932 KB Output is correct
12 Correct 434 ms 15700 KB Output is correct
13 Correct 418 ms 15984 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 580 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 5 ms 564 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 5 ms 560 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 0 ms 444 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 528 ms 14452 KB Output is correct
23 Correct 587 ms 15056 KB Output is correct
24 Correct 595 ms 15508 KB Output is correct
25 Correct 564 ms 14928 KB Output is correct
26 Correct 567 ms 16208 KB Output is correct
27 Correct 462 ms 15188 KB Output is correct
28 Correct 424 ms 15048 KB Output is correct
29 Correct 589 ms 16208 KB Output is correct
30 Correct 544 ms 16212 KB Output is correct
31 Correct 550 ms 14928 KB Output is correct
32 Correct 454 ms 14932 KB Output is correct
33 Correct 434 ms 15700 KB Output is correct
34 Correct 418 ms 15984 KB Output is correct
35 Correct 545 ms 14416 KB Output is correct
36 Correct 540 ms 16004 KB Output is correct
37 Correct 545 ms 16724 KB Output is correct
38 Correct 554 ms 16704 KB Output is correct
39 Correct 563 ms 16724 KB Output is correct
40 Correct 541 ms 16460 KB Output is correct
41 Correct 576 ms 16468 KB Output is correct
42 Correct 564 ms 16460 KB Output is correct
43 Correct 544 ms 16076 KB Output is correct
44 Correct 568 ms 16200 KB Output is correct
45 Correct 546 ms 16100 KB Output is correct
46 Correct 580 ms 17236 KB Output is correct
47 Correct 430 ms 15956 KB Output is correct
48 Correct 406 ms 15696 KB Output is correct
49 Correct 546 ms 14928 KB Output is correct
50 Correct 430 ms 15708 KB Output is correct
51 Correct 420 ms 16080 KB Output is correct
52 Correct 429 ms 15700 KB Output is correct