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>
#define ll long long
using namespace std;
ll n, q, s, t, l, r, x;
ll a[200010];
//incer subtask 1
int main(){
cin >> n >> q >> s >> t;
for(int i=0; i<=n; i++){
cin >>a[i];
}
while(q--){
cin >> l >> r >> x;
for(int i=l; i<=r; i++){
a[i]+=x;
}
// for(int i=0; i<=n; i++) cout << a[i] << " "; cout << endl;
ll ans=0;
for(int i=1; i<=n; i++){
if(a[i]>a[i-1]) ans-=s*(a[i]-a[i-1]);
if(a[i]<a[i-1]) ans+=t*(a[i-1]-a[i]);
}
cout << ans << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |