oj.uz

Submission #146610

# Submission time Handle Problem Language Result Execution time Memory
146610 2019-08-24T18:04:33 Z sofhiasouza Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 736 ms 13268 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

const int maxn = 2e5+10;

ll n, q, a[maxn];
ll sum, dif[maxn], s, t;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> q >> s >> t;

	for(int i = 0 ; i <= n ; i++) cin >> a[i];	

	for(int i = 1 ; i <= n ; i++)
	{
		dif[i] = a[i]-a[i-1];
		if(dif[i] <= 0) sum += abs(dif[i]*t);
		else sum -= abs(dif[i]*s);
	}

	//cout << sum << endl;

	dif[0] = dif[n+1] = 0;

	//for(int i = 1 ; i <= n ; i++) cout << dif[i] << ' ';
	//cout << endl;

	for(int i = 0 ; i < q ; i++)
	{
		int l, r, x;
		cin >> l >> r >> x;

		//cout << dif[l] << ' ' << dif[r+1] << endl; 

		if(dif[l] <= 0) sum -= abs(dif[l]*t);
		else sum += abs(dif[l]*s);

		if(dif[r+1] <= 0) sum -= abs(dif[r+1]*t);
		else sum += abs(dif[r+1]*s);

		dif[l] += x;
		if(r+1 <= n) dif[r+1] -= x;

		if(dif[l] <= 0) sum += abs(dif[l]*t);
		else sum -= abs(dif[l]*s);

		if(dif[r+1] <= 0) sum += abs(dif[r+1]*t);
		else sum -= abs(dif[r+1]*s);		
	
		//cout << dif[l] << ' ' << dif[r+1] << endl; 

		cout << sum << endl;
	
	//	for(int i = 1 ; i <= n ; i++) cout << dif[i] << ' ';
//	cout << endl;
	}

}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 504 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 9 ms 504 KB Output is correct
6 Correct 9 ms 504 KB Output is correct
7 Correct 8 ms 476 KB Output is correct
8 Correct 9 ms 504 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 9 ms 504 KB Output is correct
17 Correct 9 ms 504 KB Output is correct
18 Correct 8 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 692 ms 6540 KB Output is correct
2 Correct 687 ms 11128 KB Output is correct
3 Correct 690 ms 11696 KB Output is correct
4 Correct 678 ms 10972 KB Output is correct
5 Correct 685 ms 12056 KB Output is correct
6 Correct 654 ms 11212 KB Output is correct
7 Correct 651 ms 11004 KB Output is correct
8 Correct 692 ms 11996 KB Output is correct
9 Correct 687 ms 12280 KB Output is correct
10 Correct 678 ms 10872 KB Output is correct
11 Correct 644 ms 11104 KB Output is correct
12 Correct 651 ms 11868 KB Output is correct
13 Correct 650 ms 12044 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 504 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 9 ms 504 KB Output is correct
6 Correct 9 ms 504 KB Output is correct
7 Correct 8 ms 476 KB Output is correct
8 Correct 9 ms 504 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 9 ms 504 KB Output is correct
17 Correct 9 ms 504 KB Output is correct
18 Correct 8 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 692 ms 6540 KB Output is correct
23 Correct 687 ms 11128 KB Output is correct
24 Correct 690 ms 11696 KB Output is correct
25 Correct 678 ms 10972 KB Output is correct
26 Correct 685 ms 12056 KB Output is correct
27 Correct 654 ms 11212 KB Output is correct
28 Correct 651 ms 11004 KB Output is correct
29 Correct 692 ms 11996 KB Output is correct
30 Correct 687 ms 12280 KB Output is correct
31 Correct 678 ms 10872 KB Output is correct
32 Correct 644 ms 11104 KB Output is correct
33 Correct 651 ms 11868 KB Output is correct
34 Correct 650 ms 12044 KB Output is correct
35 Correct 686 ms 10440 KB Output is correct
36 Correct 689 ms 11896 KB Output is correct
37 Correct 691 ms 12844 KB Output is correct
38 Correct 688 ms 12580 KB Output is correct
39 Correct 690 ms 12492 KB Output is correct
40 Correct 687 ms 12380 KB Output is correct
41 Correct 689 ms 12468 KB Output is correct
42 Correct 690 ms 12664 KB Output is correct
43 Correct 703 ms 11704 KB Output is correct
44 Correct 700 ms 12060 KB Output is correct
45 Correct 736 ms 12212 KB Output is correct
46 Correct 733 ms 13268 KB Output is correct
47 Correct 698 ms 11680 KB Output is correct
48 Correct 653 ms 11808 KB Output is correct
49 Correct 669 ms 10900 KB Output is correct
50 Correct 660 ms 11488 KB Output is correct
51 Correct 652 ms 11964 KB Output is correct
52 Correct 649 ms 11720 KB Output is correct