oj.uz

Submission #146635

# Submission time Handle Problem Language Result Execution time Memory
146635 2019-08-24T18:48:52 Z pamaj Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 159 ms 12220 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 << "\n";
	
	//	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 3 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 4 ms 552 KB Output is correct
8 Correct 3 ms 472 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 384 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 142 ms 9736 KB Output is correct
2 Correct 137 ms 10360 KB Output is correct
3 Correct 140 ms 11000 KB Output is correct
4 Correct 131 ms 10104 KB Output is correct
5 Correct 136 ms 11104 KB Output is correct
6 Correct 117 ms 11124 KB Output is correct
7 Correct 115 ms 11100 KB Output is correct
8 Correct 159 ms 11384 KB Output is correct
9 Correct 148 ms 11752 KB Output is correct
10 Correct 140 ms 10360 KB Output is correct
11 Correct 112 ms 10744 KB Output is correct
12 Correct 115 ms 11376 KB Output is correct
13 Correct 115 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 4 ms 552 KB Output is correct
8 Correct 3 ms 472 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 142 ms 9736 KB Output is correct
23 Correct 137 ms 10360 KB Output is correct
24 Correct 140 ms 11000 KB Output is correct
25 Correct 131 ms 10104 KB Output is correct
26 Correct 136 ms 11104 KB Output is correct
27 Correct 117 ms 11124 KB Output is correct
28 Correct 115 ms 11100 KB Output is correct
29 Correct 159 ms 11384 KB Output is correct
30 Correct 148 ms 11752 KB Output is correct
31 Correct 140 ms 10360 KB Output is correct
32 Correct 112 ms 10744 KB Output is correct
33 Correct 115 ms 11376 KB Output is correct
34 Correct 115 ms 11896 KB Output is correct
35 Correct 135 ms 10132 KB Output is correct
36 Correct 141 ms 11384 KB Output is correct
37 Correct 145 ms 12152 KB Output is correct
38 Correct 144 ms 11956 KB Output is correct
39 Correct 146 ms 11916 KB Output is correct
40 Correct 149 ms 12220 KB Output is correct
41 Correct 145 ms 11912 KB Output is correct
42 Correct 142 ms 11808 KB Output is correct
43 Correct 143 ms 10764 KB Output is correct
44 Correct 144 ms 11088 KB Output is correct
45 Correct 140 ms 11044 KB Output is correct
46 Correct 146 ms 11920 KB Output is correct
47 Correct 118 ms 11476 KB Output is correct
48 Correct 116 ms 11316 KB Output is correct
49 Correct 125 ms 10400 KB Output is correct
50 Correct 111 ms 10964 KB Output is correct
51 Correct 115 ms 11828 KB Output is correct
52 Correct 113 ms 11252 KB Output is correct