oj.uz

Submission #868529

# Submission time Handle Problem Language Result Execution time Memory
868529 2023-10-31T16:44:35 Z amirhoseinfar1385 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 198 ms 13696 KB 
#include<bits/stdc++.h>
using namespace std;
long long n,m,s,t;
int kaf=(1<<18);

struct segment{
	long long seg[(1<<19)];
	void upd(int i,int l,int r,int tl,int tr,long long w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			seg[i]+=w;
			return ;
		}
		int m=(l+r)>>1;
		upd((i<<1),l,m,tl,tr,w);
		upd((i<<1)^1,m+1,r,tl,tr,w);
	}
	long long pors(int i){
		if(i==0){
			return 0;
		}
		long long ret=seg[i]+pors((i>>1));
		return ret;
	}
}seg;

long long cal(int ind){
	if(ind==n){
		return 0;
	}
	long long av=seg.pors(kaf+ind);
	long long dov=seg.pors(kaf+ind+1);
	long long ret=0;
	if(dov>av){
		ret=-1ll*(dov-av)*s;
	}
	else{
		ret=1ll*(av-dov)*t;
	}
	return ret;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m>>s>>t;
	for(int i=0;i<=n;i++){
		int d;
		cin>>d;
		seg.upd(1,0,kaf-1,i,i,d);
	}
	long long res=0;
	for(int i=0;i<n;i++){
		res+=cal(i);
	}
	//cout<<res<<"\n";
	for(int i=0;i<m;i++){
		int l,r;
		long long w;
		cin>>l>>r>>w;
		res-=cal(l-1);
		res-=cal(r);
		seg.upd(1,0,kaf-1,l,r,w);
		res+=cal(l-1);
		res+=cal(r);
		cout<<res<<"\n";
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2524 KB Output is correct
9 Correct 2 ms 2520 KB Output is correct
10 Correct 2 ms 2588 KB Output is correct
11 Correct 2 ms 2588 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 2 ms 2604 KB Output is correct
14 Correct 2 ms 2520 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 10780 KB Output is correct
2 Correct 167 ms 11352 KB Output is correct
3 Correct 175 ms 11848 KB Output is correct
4 Correct 164 ms 11444 KB Output is correct
5 Correct 176 ms 12644 KB Output is correct
6 Correct 126 ms 11344 KB Output is correct
7 Correct 121 ms 11348 KB Output is correct
8 Correct 165 ms 12432 KB Output is correct
9 Correct 160 ms 12624 KB Output is correct
10 Correct 158 ms 11348 KB Output is correct
11 Correct 115 ms 11352 KB Output is correct
12 Correct 123 ms 12116 KB Output is correct
13 Correct 120 ms 12156 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2524 KB Output is correct
9 Correct 2 ms 2520 KB Output is correct
10 Correct 2 ms 2588 KB Output is correct
11 Correct 2 ms 2588 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 2 ms 2604 KB Output is correct
14 Correct 2 ms 2520 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 174 ms 10780 KB Output is correct
23 Correct 167 ms 11352 KB Output is correct
24 Correct 175 ms 11848 KB Output is correct
25 Correct 164 ms 11444 KB Output is correct
26 Correct 176 ms 12644 KB Output is correct
27 Correct 126 ms 11344 KB Output is correct
28 Correct 121 ms 11348 KB Output is correct
29 Correct 165 ms 12432 KB Output is correct
30 Correct 160 ms 12624 KB Output is correct
31 Correct 158 ms 11348 KB Output is correct
32 Correct 115 ms 11352 KB Output is correct
33 Correct 123 ms 12116 KB Output is correct
34 Correct 120 ms 12156 KB Output is correct
35 Correct 176 ms 10836 KB Output is correct
36 Correct 168 ms 12364 KB Output is correct
37 Correct 169 ms 13240 KB Output is correct
38 Correct 198 ms 12808 KB Output is correct
39 Correct 175 ms 13128 KB Output is correct
40 Correct 171 ms 12940 KB Output is correct
41 Correct 170 ms 13056 KB Output is correct
42 Correct 169 ms 12884 KB Output is correct
43 Correct 169 ms 12144 KB Output is correct
44 Correct 169 ms 12540 KB Output is correct
45 Correct 162 ms 12676 KB Output is correct
46 Correct 169 ms 13696 KB Output is correct
47 Correct 161 ms 12112 KB Output is correct
48 Correct 121 ms 12368 KB Output is correct
49 Correct 156 ms 11092 KB Output is correct
50 Correct 115 ms 11784 KB Output is correct
51 Correct 139 ms 12276 KB Output is correct
52 Correct 133 ms 12116 KB Output is correct