Submission #1275524

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275524		zagaro	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	120 ms	7176 KiB

foehn_phenomena

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
ll n, q, s, t;
void act(ll p, ll x, vector<ll> &prf){
    wl(p <= n){
        prf[p] += x;
        p += (p&(-p));
    }
    return ;
}
ll query(ll p, vector<ll> &prf){
    if(p == -1)return 0;
    ll r=0;
    wl(p != 0){
        r += prf[p];
        p -= (p&(-p));
    }
    return r;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll a, b, v, x, y;
    cin>>n>>q>>s>>t;
    vector<ll> vec(n+1);
    vector<ll> prf(n+1, 0);
    cin>>a;
    for(int i=1;i<=n;i++){
        cin>>b;
        act(i, b, vec);
        if(i<n)act(i+1, -b, vec);
        if(a < b)act(i, -(b-a)*s, prf);
        else act(i, (a-b)*t, prf);
        a=b;
    }
    wl(q--){
        cin>>a>>b>>v;
        x = query(a-1, vec);y = query(a, vec);
        if(x < y)act(a, (y-x)*s, prf);
        else act(a, -(x-y)*t, prf);
        if(b < n){
            x = query(b, vec);y = query(b+1, vec);
            if(x < y)act(b+1, (y-x)*s, prf);
            else act(b+1, -(x-y)*t, prf);
        }
        act(a, v, vec);act(b+1, -v, vec);
        x = query(a-1, vec);y = query(a, vec);
        if(x < y)act(a, -(y-x)*s, prf);
        else act(a, (x-y)*t, prf);
        if(b < n){
            x = query(b, vec);y = query(b+1, vec);
            if(x < y)act(b+1, -(y-x)*s, prf);
            else act(b+1, (x-y)*t, prf);
        }
        cout<<query(n, prf)<<ENDL;
    }
    return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60