oj.uz

Submission #303556

# Submission time Handle Problem Language Result Execution time Memory
303556 2020-09-20T12:30:01 Z Bill_00 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 568 ms 13176 KB 
#include <bits/stdc++.h>
#define ll long long 
using namespace std;
ll a[200001],dp[200001];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n,q,s,t,ih=0,baga=0;
	cin >> n >> q >> s >> t;
	cin >> a[0];
	for(int i=1;i<=n;i++){
		cin >> a[i];
		if(a[i]>a[i-1]){
			ih+=(a[i]-a[i-1]);
		}
		else baga+=(a[i-1]-a[i]);
		dp[i]=a[i]-a[i-1];
	}
	for(int i=1;i<=q;i++){
		//cout << ih << ' ' << baga << endl;
		ll l,r,x;
		cin >> l >> r >> x;
		ll p=dp[l];
		ll q=dp[l]+x;
		if(p>0 && q>0){
			ih+=x;
		}
		if(p>0 && q<=0){
			ih-=p;
			baga+=(abs(q));
		}
		if(p<=0 && q>0){
			ih+=q;
			baga-=(abs(p));
		}
		if(p<=0 && q<=0){
			baga-=x;
		}
		dp[l]=q;
		if(r!=n){
			ll p=dp[r+1];
			ll q=dp[r+1]-x;
			if(p>0 && q>0){
				ih-=x;
			}
			if(p>0 && q<=0){
				ih-=p;
				baga+=(abs(q));
			}
			if(p<=0 && q>0){
				ih+=q;
				baga-=(abs(p));
			}
			if(p<=0 && q<=0){
				baga+=x;
			}
			dp[r+1]=q;
		}
		cout << -ih*s+baga*t << endl;
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 562 ms 4972 KB Output is correct
2 Correct 544 ms 5624 KB Output is correct
3 Correct 566 ms 6392 KB Output is correct
4 Correct 558 ms 5368 KB Output is correct
5 Correct 550 ms 6264 KB Output is correct
6 Correct 529 ms 11512 KB Output is correct
7 Correct 536 ms 11104 KB Output is correct
8 Correct 565 ms 11896 KB Output is correct
9 Correct 557 ms 12280 KB Output is correct
10 Correct 542 ms 11128 KB Output is correct
11 Correct 527 ms 11128 KB Output is correct
12 Correct 525 ms 11768 KB Output is correct
13 Correct 516 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 416 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 562 ms 4972 KB Output is correct
23 Correct 544 ms 5624 KB Output is correct
24 Correct 566 ms 6392 KB Output is correct
25 Correct 558 ms 5368 KB Output is correct
26 Correct 550 ms 6264 KB Output is correct
27 Correct 529 ms 11512 KB Output is correct
28 Correct 536 ms 11104 KB Output is correct
29 Correct 565 ms 11896 KB Output is correct
30 Correct 557 ms 12280 KB Output is correct
31 Correct 542 ms 11128 KB Output is correct
32 Correct 527 ms 11128 KB Output is correct
33 Correct 525 ms 11768 KB Output is correct
34 Correct 516 ms 11896 KB Output is correct
35 Correct 544 ms 10592 KB Output is correct
36 Correct 562 ms 11896 KB Output is correct
37 Correct 568 ms 12792 KB Output is correct
38 Correct 556 ms 12704 KB Output is correct
39 Correct 558 ms 12540 KB Output is correct
40 Correct 552 ms 12536 KB Output is correct
41 Correct 553 ms 12280 KB Output is correct
42 Correct 557 ms 12792 KB Output is correct
43 Correct 560 ms 11768 KB Output is correct
44 Correct 551 ms 12280 KB Output is correct
45 Correct 554 ms 12152 KB Output is correct
46 Correct 564 ms 13176 KB Output is correct
47 Correct 538 ms 11768 KB Output is correct
48 Correct 527 ms 11896 KB Output is correct
49 Correct 543 ms 10876 KB Output is correct
50 Correct 536 ms 11512 KB Output is correct
51 Correct 524 ms 11900 KB Output is correct
52 Correct 530 ms 11896 KB Output is correct