| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 68203 | almasalmas | Foehn Phenomena (JOI17_foehn_phenomena) | C++17 | 46 ms | 4080 KiB | 
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 int long long
using namespace std;
int a[100001];
 main () {
	int n, q, s, t;
	cin >> n >> q >> s >> t;
	for (int i = 0;i <= n;i ++) cin >> a[i];
	while (q --) {
		int l, r, x;
		cin >> l >> r >> x;
		for (int i = l;i <= r;i ++) a[i] += x;
		int cur = 0;
		for  (int i = 1;i <= n;i ++) {
			int len = abs (a[i] - a[i - 1]);
			if (a[i] > a[i - 1]) {
				cur -= len * s;
			}
			else cur += len * t;
		}
		cout << cur << endl;
	}
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
