oj.uz

Submission #670443

# Submission time Handle Problem Language Result Execution time Memory
670443 2022-12-09T06:18:20 Z Mahdi Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 122 ms 6412 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=2e5+5;
int n, q, s, t, a[N];
ll ans;

struct fenwick{
    vector<ll>bit;

    void add(int i, int val){
        for(;i<=n;i|=(i+1))
            bit[i]+=val;
    }

    void add(int l, int r, int val){
        add(l, val);
        add(r, -val);
    }

    ll sum(int i){
        ll res=0;
        for(;i>=0;i=(i&(i+1))-1)
            res+=bit[i];
        return res;
    }
} A;

inline ll num(int i){
    return A.sum(i)+a[i];
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>q>>s>>t;
    for(int i=0;i<=n;++i)
        cin>>a[i];
    for(int i=1;i<=n;++i){
        if(a[i]>a[i-1])
            ans-=1LL*(a[i]-a[i-1])*s;
        else
            ans+=1LL*(a[i-1]-a[i])*t;
    }
    A.bit.assign(n+1, 0);
    while(q--){
        int l, r, x;
        cin>>l>>r>>x;
        ll y=num(l-1), z=num(l);
        if(z>y)
            ans+=1LL*(z-y)*s;
        else
            ans-=1LL*(y-z)*t;
        z+=x;
        if(z>y)
            ans-=1LL*(z-y)*s;
        else
            ans+=1LL*(y-z)*t;
        if(r<n){
            y=num(r);z=num(r+1);
            if(z>y)
                ans+=1LL*(z-y)*s;
            else
                ans-=1LL*(y-z)*t;
            y+=x;
            if(z>y)
                ans-=1LL*(z-y)*s;
            else
                ans+=1LL*(y-z)*t;
        }
        A.add(l, r+1, x);
        cout<<ans<<'\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 392 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 4236 KB Output is correct
2 Correct 104 ms 4772 KB Output is correct
3 Correct 106 ms 5524 KB Output is correct
4 Correct 111 ms 4632 KB Output is correct
5 Correct 109 ms 5388 KB Output is correct
6 Correct 78 ms 5892 KB Output is correct
7 Correct 82 ms 5704 KB Output is correct
8 Correct 102 ms 5692 KB Output is correct
9 Correct 102 ms 5956 KB Output is correct
10 Correct 109 ms 4668 KB Output is correct
11 Correct 80 ms 5708 KB Output is correct
12 Correct 78 ms 6148 KB Output is correct
13 Correct 77 ms 6344 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 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 392 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 110 ms 4236 KB Output is correct
23 Correct 104 ms 4772 KB Output is correct
24 Correct 106 ms 5524 KB Output is correct
25 Correct 111 ms 4632 KB Output is correct
26 Correct 109 ms 5388 KB Output is correct
27 Correct 78 ms 5892 KB Output is correct
28 Correct 82 ms 5704 KB Output is correct
29 Correct 102 ms 5692 KB Output is correct
30 Correct 102 ms 5956 KB Output is correct
31 Correct 109 ms 4668 KB Output is correct
32 Correct 80 ms 5708 KB Output is correct
33 Correct 78 ms 6148 KB Output is correct
34 Correct 77 ms 6344 KB Output is correct
35 Correct 122 ms 4188 KB Output is correct
36 Correct 109 ms 5636 KB Output is correct
37 Correct 110 ms 6388 KB Output is correct
38 Correct 110 ms 6276 KB Output is correct
39 Correct 111 ms 6224 KB Output is correct
40 Correct 110 ms 6220 KB Output is correct
41 Correct 107 ms 6140 KB Output is correct
42 Correct 107 ms 6196 KB Output is correct
43 Correct 106 ms 5448 KB Output is correct
44 Correct 105 ms 5884 KB Output is correct
45 Correct 103 ms 5672 KB Output is correct
46 Correct 106 ms 6260 KB Output is correct
47 Correct 80 ms 6376 KB Output is correct
48 Correct 91 ms 6412 KB Output is correct
49 Correct 96 ms 5360 KB Output is correct
50 Correct 86 ms 6256 KB Output is correct
51 Correct 79 ms 6260 KB Output is correct
52 Correct 78 ms 6216 KB Output is correct