oj.uz

Submission #657087

# Submission time Handle Problem Language Result Execution time Memory
657087 2022-11-08T20:43:27 Z Juan Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 597 ms 14608 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
#define ll long long

ll v[maxn], vans[maxn];
ll bit[maxn];

void upd(int id, int val){
	for(; id < maxn; id+=id&-id) bit[id] += val;
}

ll sum(int id){
	ll rt = 0;
	for(; id>0; id-=id&-id) rt += bit[id];
	return rt;
}

int main(){
	int n, q, s, t; cin >> n >> q >> s >> t;
	for(int i = 0; i <= n; i++) cin >> v[i];

	ll ans = 0;
	for(int i = 0; i < n; i++){
		if(v[i+1]>v[i]) vans[i] = -(v[i+1]-v[i])*s;
		else vans[i] = (v[i]-v[i+1])*t;
		ans += vans[i];
	}
	while(q--){
		int l, r, x; cin >> l >> r >> x;
		upd(l, x), upd(r+1, -x);
		ll a=0, b=0;
		a = v[l]+sum(l) - (v[l-1]+sum(l-1));
		if(r<n) b = v[r+1]+sum(r+1) - (v[r]+sum(r));

		if(a>0) a*=-s;
		else a*=-t;
		if(b>0) b*=-s;
		else b*=-t;
		ans -= vans[l-1] + vans[r];
		ans += a+b;
		vans[l-1] = a, vans[r] = b;
		cout << ans << "\n";
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 444 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 6 ms 468 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 5 ms 448 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 5 ms 460 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 7584 KB Output is correct
2 Correct 551 ms 11472 KB Output is correct
3 Correct 573 ms 12140 KB Output is correct
4 Correct 548 ms 11224 KB Output is correct
5 Correct 560 ms 12232 KB Output is correct
6 Correct 465 ms 10968 KB Output is correct
7 Correct 525 ms 10976 KB Output is correct
8 Correct 548 ms 12328 KB Output is correct
9 Correct 577 ms 12624 KB Output is correct
10 Correct 597 ms 11432 KB Output is correct
11 Correct 506 ms 10968 KB Output is correct
12 Correct 507 ms 11280 KB Output is correct
13 Correct 489 ms 11656 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 444 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 6 ms 468 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 5 ms 448 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 468 KB Output is correct
17 Correct 5 ms 460 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 548 ms 7584 KB Output is correct
23 Correct 551 ms 11472 KB Output is correct
24 Correct 573 ms 12140 KB Output is correct
25 Correct 548 ms 11224 KB Output is correct
26 Correct 560 ms 12232 KB Output is correct
27 Correct 465 ms 10968 KB Output is correct
28 Correct 525 ms 10976 KB Output is correct
29 Correct 548 ms 12328 KB Output is correct
30 Correct 577 ms 12624 KB Output is correct
31 Correct 597 ms 11432 KB Output is correct
32 Correct 506 ms 10968 KB Output is correct
33 Correct 507 ms 11280 KB Output is correct
34 Correct 489 ms 11656 KB Output is correct
35 Correct 553 ms 12008 KB Output is correct
36 Correct 555 ms 13408 KB Output is correct
37 Correct 542 ms 14148 KB Output is correct
38 Correct 560 ms 13968 KB Output is correct
39 Correct 538 ms 13920 KB Output is correct
40 Correct 549 ms 13900 KB Output is correct
41 Correct 551 ms 13772 KB Output is correct
42 Correct 529 ms 13904 KB Output is correct
43 Correct 523 ms 13344 KB Output is correct
44 Correct 510 ms 13668 KB Output is correct
45 Correct 524 ms 13516 KB Output is correct
46 Correct 550 ms 14608 KB Output is correct
47 Correct 482 ms 11676 KB Output is correct
48 Correct 493 ms 11684 KB Output is correct
49 Correct 503 ms 12240 KB Output is correct
50 Correct 448 ms 11472 KB Output is correct
51 Correct 495 ms 11852 KB Output is correct
52 Correct 525 ms 11656 KB Output is correct