oj.uz

Submission #916627

# Submission time Handle Problem Language Result Execution time Memory
916627 2024-01-26T07:32:40 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 325 ms 11460 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define fi first
#define se second

ll n, q, s, t, l, r, d, add, sub, temp;
ll a[200001];

void f(ll p, ll d) {
	if (p < 1 or p > n) {
		return;
	}
	if (a[p] > 0) {
		add -= a[p];
	} else {
		sub += a[p];
	}
	a[p] += d;
	if (a[p] > 0) {
		add += a[p];
	} else {
		sub -= a[p];
	}
}

int main() {
	fastio;
	cin >> n >> q >> s >> t;
	for (int i = 0; i <= n; i++) {
		cin >> a[i];
		a[i] -= temp;
		if (a[i] > 0) {
			add += a[i];
		} else {
			sub -= a[i];
		}
		temp += a[i];
	}
	for (int i = 0; i < q; i++) {
		cin >> l >> r >> d;
		f(l, d);
		f(r+1, -d);
		cout << -(add*s-sub*t) << endl;
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 352 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 540 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 8700 KB Output is correct
2 Correct 299 ms 9472 KB Output is correct
3 Correct 325 ms 9812 KB Output is correct
4 Correct 284 ms 9304 KB Output is correct
5 Correct 297 ms 10572 KB Output is correct
6 Correct 279 ms 9500 KB Output is correct
7 Correct 283 ms 9348 KB Output is correct
8 Correct 313 ms 10560 KB Output is correct
9 Correct 297 ms 10628 KB Output is correct
10 Correct 299 ms 9388 KB Output is correct
11 Correct 274 ms 9400 KB Output is correct
12 Correct 295 ms 10380 KB Output is correct
13 Correct 278 ms 10276 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 352 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 540 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 290 ms 8700 KB Output is correct
23 Correct 299 ms 9472 KB Output is correct
24 Correct 325 ms 9812 KB Output is correct
25 Correct 284 ms 9304 KB Output is correct
26 Correct 297 ms 10572 KB Output is correct
27 Correct 279 ms 9500 KB Output is correct
28 Correct 283 ms 9348 KB Output is correct
29 Correct 313 ms 10560 KB Output is correct
30 Correct 297 ms 10628 KB Output is correct
31 Correct 299 ms 9388 KB Output is correct
32 Correct 274 ms 9400 KB Output is correct
33 Correct 295 ms 10380 KB Output is correct
34 Correct 278 ms 10276 KB Output is correct
35 Correct 290 ms 9044 KB Output is correct
36 Correct 295 ms 10320 KB Output is correct
37 Correct 309 ms 11148 KB Output is correct
38 Correct 305 ms 10832 KB Output is correct
39 Correct 310 ms 10868 KB Output is correct
40 Correct 297 ms 10908 KB Output is correct
41 Correct 318 ms 10608 KB Output is correct
42 Correct 293 ms 10752 KB Output is correct
43 Correct 320 ms 10400 KB Output is correct
44 Correct 308 ms 10532 KB Output is correct
45 Correct 299 ms 10588 KB Output is correct
46 Correct 316 ms 11460 KB Output is correct
47 Correct 295 ms 10072 KB Output is correct
48 Correct 284 ms 10172 KB Output is correct
49 Correct 282 ms 9040 KB Output is correct
50 Correct 289 ms 9932 KB Output is correct
51 Correct 282 ms 10532 KB Output is correct
52 Correct 286 ms 10252 KB Output is correct