This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long a[200005], s, t, T, x, n, q, l, r;
long long f(long long x){
return (x > 0 ? s : t) * -x;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>q>>s>>t;
for(int i = 0; i <= n; i++)
cin>>a[i];
for(int i = n; i > 0; i--){
a[i] -= a[i - 1];
T += (a[i] > 0 ? s : t) * -a[i];
}
while(q--){
cin>>l>>r>>x;
++r;
T -= f(a[l]);
a[l] += x;
T += f(a[l]);
if(r <= n){
T -= f(a[r]);
a[r] -= x;
T += f(a[r]);
}
cout<<T<<'\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |