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;
inline namespace
{
} // namespace
void solve(int _test_ = -1)
{
int n, q;
long s, t;
cin >> n >> q >> s >> t;
vector<long> a(n + 1);
for (long &x : a)
cin >> x;
vector<long> d(n);
for (int i = 0; i < n; i++)
d[i] = a[i + 1] - a[i];
long res = 0;
for (long x : d)
res -= x * (x >= 0 ? s : t);
for (int z = 0; z < q; z++)
{
int l, r;
long x;
cin >> l >> r >> x, --l;
{
res += d[l] * (d[l] >= 0 ? s : t);
d[l] += x;
res -= d[l] * (d[l] >= 0 ? s : t);
}
if (r < n)
{
res += d[r] * (d[r] >= 0 ? s : t);
d[r] -= x;
res -= d[r] * (d[r] >= 0 ? s : t);
}
cout << res << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(NULL);
int T_ = 1;
// cin >> T_;
for (int t_ = 0; t_ < T_; t_++)
solve(t_);
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... |