oj.uz

Submission #751176

# Submission time Handle Problem Language Result Execution time Memory
751176 2023-05-31T07:19:00 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 337 ms 8448 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll N, Q, S, T;
ll a[200100], b[200100];
ll L, R, X, ans;

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> N >> Q >> S >> T;
	cin >> a[0];
	for(int i=1; i<=N; i++) {
		cin >> a[i];
		b[i] = a[i]-a[i-1];
		ans += (b[i] > 0)?(-S*b[i]):(T*(-b[i]));
	}
	//cout << ans << endl;
	for(int i=1; i<=Q; i++) {
		cin >> L >> R >> X;
		ans -= (b[L] > 0)?(-S*b[L]):(T*(-b[L]));
		b[L]+=X;
		ans += (b[L] > 0)?(-S*b[L]):(T*(-b[L]));
		
		if (R<N) {
			ans -= (b[R+1] > 0)?(-S*b[R+1]):(T*(-b[R+1]));
			b[R+1]-=X;
			ans += (b[R+1] > 0)?(-S*b[R+1]):(T*(-b[R+1]));
		}
		cout << ans << endl;
	}
}

// b[i] = a[i]-a[i-1]
// jika b[i]>0, temp-=S
// jika b[i]<=0, temp+=T
// jika A[L...R] += X, maka, b[L]+=X dan b[R+1]-=X

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 5 ms 428 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 6696 KB Output is correct
2 Correct 316 ms 6296 KB Output is correct
3 Correct 313 ms 6984 KB Output is correct
4 Correct 312 ms 6040 KB Output is correct
5 Correct 325 ms 6820 KB Output is correct
6 Correct 301 ms 7284 KB Output is correct
7 Correct 301 ms 7184 KB Output is correct
8 Correct 321 ms 7252 KB Output is correct
9 Correct 324 ms 7708 KB Output is correct
10 Correct 328 ms 6224 KB Output is correct
11 Correct 300 ms 7296 KB Output is correct
12 Correct 302 ms 7656 KB Output is correct
13 Correct 303 ms 8072 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 5 ms 428 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 317 ms 6696 KB Output is correct
23 Correct 316 ms 6296 KB Output is correct
24 Correct 313 ms 6984 KB Output is correct
25 Correct 312 ms 6040 KB Output is correct
26 Correct 325 ms 6820 KB Output is correct
27 Correct 301 ms 7284 KB Output is correct
28 Correct 301 ms 7184 KB Output is correct
29 Correct 321 ms 7252 KB Output is correct
30 Correct 324 ms 7708 KB Output is correct
31 Correct 328 ms 6224 KB Output is correct
32 Correct 300 ms 7296 KB Output is correct
33 Correct 302 ms 7656 KB Output is correct
34 Correct 303 ms 8072 KB Output is correct
35 Correct 318 ms 5856 KB Output is correct
36 Correct 337 ms 7324 KB Output is correct
37 Correct 307 ms 8128 KB Output is correct
38 Correct 316 ms 7876 KB Output is correct
39 Correct 315 ms 7956 KB Output is correct
40 Correct 311 ms 7844 KB Output is correct
41 Correct 326 ms 7708 KB Output is correct
42 Correct 320 ms 7812 KB Output is correct
43 Correct 319 ms 7112 KB Output is correct
44 Correct 316 ms 7436 KB Output is correct
45 Correct 317 ms 7468 KB Output is correct
46 Correct 307 ms 7948 KB Output is correct
47 Correct 295 ms 7840 KB Output is correct
48 Correct 295 ms 8448 KB Output is correct
49 Correct 295 ms 7120 KB Output is correct
50 Correct 304 ms 7948 KB Output is correct
51 Correct 308 ms 7844 KB Output is correct
52 Correct 296 ms 8096 KB Output is correct