oj.uz

Submission #894644

# Submission time Handle Problem Language Result Execution time Memory
894644 2023-12-28T15:20:05 Z reginox Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 401 ms 18564 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2e5+3;
struct segtree{
	ll tree[maxn*4], lazy[maxn*4];
	void reset(){
		memset(tree, 0, sizeof(tree));
		memset(lazy, 0, sizeof(lazy));
	}
	void down(ll u){
		ll t = lazy[u];
		tree[u*2]+=t;
		tree[u*2+1]+=t;
		lazy[u*2]+=t;
		lazy[u*2+1]+=t;
		lazy[u]=0;
	}
	void upd(ll id, ll l, ll r, ll u, ll v, ll val){
		if(l>r) return ;
		if(r<u||v<l) return ;
		if(u<=l && v>=r){
			tree[id]+=val;
			lazy[id]+=val;
			return ;
		}
		down(id);
		ll mid = (l+r)>>1;
		upd(id*2, l, mid, u, v, val);
		upd(id*2+1, mid+1, r, u, v, val);
		tree[id]=tree[id*2]+tree[id*2+1];
	}
	ll get(ll id, ll l, ll r, ll u){
		if(u<l||r<u) return 0;
		if(l==r) return tree[id];
		down(id);
		ll mid = (l+r)>>1;
		return get(id*2, l, mid, u) + get(id*2+1, mid+1, r, u);
	}
} tree;
ll n, q, s, t, x, sum, p, l, r, l1, l2, r1, r2, pl1, pl2, pr1, pr2;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> q >> s >> t;
	for(ll i = 0; i <= n; i++){
		cin >> x;
		if(i==0) continue;
		if(p<x) sum -= (x-p)*s;
		else sum += (p-x)*t;
		tree.upd(1, 1, n, i, i, x);
		p=x;
	}
	while(q--){
		cin >> l >> r >> x;
		// cout << l << " " << r << "\n";
		if(l==1) pl1=0;
		else pl1 = tree.get(1, 1, n, l-1);
		pl2 = tree.get(1, 1, n, l);
		pr1 = tree.get(1, 1, n, r);
		if(r==n) pr2 = pr1;
		else pr2 = tree.get(1, 1, n, r+1);
		// cout << pl1 << " " << pl2 << " " << pr1 << " " << pr2 << "\n";
		
		tree.upd(1, 1, n, l, r, x);
		
		if(l==1) l1=0;
		else l1 = tree.get(1, 1, n, l-1);
		l2 = tree.get(1, 1, n, l);
		r1 = tree.get(1, 1, n, r);
		if(r==n) r2 = r1;
		else r2 = tree.get(1, 1, n, r+1);
		// cout << l1 << " " << l2 << " " << r1 << " " << r2 << "\n";
		
		if(pl1 < pl2){
			if(l1 < l2) sum += ((pl2 - pl1) - (l2 - l1))*s;
			else{
				sum += (pl2 - pl1)*s;
				sum += (l1-l2)*t;
			}
		}
		else{
			if(l1 > l2){
				sum+=((l1-l2) - (pl1-pl2))*t;
			}
			else{
				sum -= (pl1-pl2)*t;
				sum -= (l2 - l1)*s;
			}
		}
		// cout << sum << "\n";
		
		if(pr1 < pr2){
			if(r1 < r2) sum += ((pr2 - pr1) - (r2 - r1))*s;
			else{
				sum += (pr2 - pr1)*s;
				sum += (r1-r2)*t;
			}
		}
		else{
			if(r1 > r2){
				sum+=((r1-r2) - (pr1-pr2))*t;
			}
			else{
				sum -= (pr1-pr2)*t;
				sum -= (r2 - r1)*s;
			}
		}
		
		cout << sum << "\n";
	}
	return 0;
}

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 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 472 KB Output is correct
14 Correct 2 ms 584 KB Output is correct
15 Correct 3 ms 480 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 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 356 ms 15704 KB Output is correct
2 Correct 371 ms 16320 KB Output is correct
3 Correct 364 ms 16828 KB Output is correct
4 Correct 350 ms 16308 KB Output is correct
5 Correct 363 ms 17504 KB Output is correct
6 Correct 160 ms 16384 KB Output is correct
7 Correct 162 ms 16492 KB Output is correct
8 Correct 309 ms 17236 KB Output is correct
9 Correct 307 ms 17744 KB Output is correct
10 Correct 321 ms 16212 KB Output is correct
11 Correct 237 ms 16564 KB Output is correct
12 Correct 160 ms 16980 KB Output is correct
13 Correct 226 ms 17236 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 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 472 KB Output is correct
14 Correct 2 ms 584 KB Output is correct
15 Correct 3 ms 480 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 356 ms 15704 KB Output is correct
23 Correct 371 ms 16320 KB Output is correct
24 Correct 364 ms 16828 KB Output is correct
25 Correct 350 ms 16308 KB Output is correct
26 Correct 363 ms 17504 KB Output is correct
27 Correct 160 ms 16384 KB Output is correct
28 Correct 162 ms 16492 KB Output is correct
29 Correct 309 ms 17236 KB Output is correct
30 Correct 307 ms 17744 KB Output is correct
31 Correct 321 ms 16212 KB Output is correct
32 Correct 237 ms 16564 KB Output is correct
33 Correct 160 ms 16980 KB Output is correct
34 Correct 226 ms 17236 KB Output is correct
35 Correct 361 ms 15820 KB Output is correct
36 Correct 349 ms 17232 KB Output is correct
37 Correct 359 ms 17964 KB Output is correct
38 Correct 395 ms 17840 KB Output is correct
39 Correct 382 ms 17920 KB Output is correct
40 Correct 356 ms 17784 KB Output is correct
41 Correct 361 ms 17516 KB Output is correct
42 Correct 355 ms 17688 KB Output is correct
43 Correct 360 ms 17172 KB Output is correct
44 Correct 364 ms 17512 KB Output is correct
45 Correct 377 ms 17512 KB Output is correct
46 Correct 360 ms 18564 KB Output is correct
47 Correct 174 ms 17016 KB Output is correct
48 Correct 212 ms 16976 KB Output is correct
49 Correct 401 ms 16132 KB Output is correct
50 Correct 235 ms 17056 KB Output is correct
51 Correct 159 ms 17212 KB Output is correct
52 Correct 289 ms 17060 KB Output is correct