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;
#define LL long long
#define N 200010
int n, m, s, t;
LL a[N], d[N], L;
LL sum = 0;
LL p (LL x)
{
return x*(x>0 ?s :t);
}
int main()
{
cin >> n >> m >> s >> t;
cin >> L;
for(int i=1;i<=n;i ++)
{
cin >> a[i];
d[i]=a[i]-L;
L=a[i];
sum+=p(d[i]);
}
for(int i=1;i<=m;i++)
{
int l, r;
LL x;
cin >> l >> r >> x;
sum-=p(d[l]);
d[l]+=x;
sum+=p(d[l]);
if(r == n)
{
cout << -sum << '\n';
continue;
}
sum-=p(d[r+1]);
d[r+1]-=x;
sum+=p(d[r+1]);
cout << -sum << '\n';
}
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... |