oj.uz

Submission #197054

# Submission time Handle Problem Language Result Execution time Memory
197054 2020-01-18T11:39:36 Z Juney Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 146 ms 12892 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5 + 5;

int N, Q;
ll S, T, A[MAXN], B[MAXN], ans;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> N >> Q >> S >> T;
	for(int i=0; i<=N; i++) cin >> A[i];
	for(int i=1; i<=N; i++) {
		B[i] = A[i] - A[i-1];
		if(B[i] >= 0) ans -= B[i] * S;
		else ans -= B[i] * T;
	}
	while(Q--) {
		int l, r, x; cin >> l >> r >> x;
		if(B[l] >= 0) ans += B[l] * S;
		else ans += B[l] * T;
		if(r < N) {
			if(B[r+1] >= 0) ans += B[r+1] * S;
			else ans += B[r+1] * T;
		}
		B[l] += x;
		if(r < N) B[r+1] -= x;
		if(B[l] >= 0) ans -= B[l] * S;
		else ans -= B[l] * T;
		if(r < N) {
			if(B[r+1] >= 0) ans -= B[r+1] * S;
			else ans -= B[r+1] * T;
		}
		cout << ans << '\n';
	}
}

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 3 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 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 508 KB Output is correct
10 Correct 3 ms 508 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 376 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 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 137 ms 9292 KB Output is correct
2 Correct 143 ms 8744 KB Output is correct
3 Correct 143 ms 10552 KB Output is correct
4 Correct 133 ms 10616 KB Output is correct
5 Correct 138 ms 10972 KB Output is correct
6 Correct 114 ms 10872 KB Output is correct
7 Correct 114 ms 11000 KB Output is correct
8 Correct 145 ms 11640 KB Output is correct
9 Correct 142 ms 12280 KB Output is correct
10 Correct 137 ms 11064 KB Output is correct
11 Correct 108 ms 11012 KB Output is correct
12 Correct 113 ms 11000 KB Output is correct
13 Correct 116 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 3 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 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 508 KB Output is correct
10 Correct 3 ms 508 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 376 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 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 137 ms 9292 KB Output is correct
23 Correct 143 ms 8744 KB Output is correct
24 Correct 143 ms 10552 KB Output is correct
25 Correct 133 ms 10616 KB Output is correct
26 Correct 138 ms 10972 KB Output is correct
27 Correct 114 ms 10872 KB Output is correct
28 Correct 114 ms 11000 KB Output is correct
29 Correct 145 ms 11640 KB Output is correct
30 Correct 142 ms 12280 KB Output is correct
31 Correct 137 ms 11064 KB Output is correct
32 Correct 108 ms 11012 KB Output is correct
33 Correct 113 ms 11000 KB Output is correct
34 Correct 116 ms 11896 KB Output is correct
35 Correct 137 ms 9968 KB Output is correct
36 Correct 141 ms 11904 KB Output is correct
37 Correct 144 ms 12892 KB Output is correct
38 Correct 144 ms 12380 KB Output is correct
39 Correct 146 ms 11440 KB Output is correct
40 Correct 146 ms 12076 KB Output is correct
41 Correct 142 ms 11484 KB Output is correct
42 Correct 144 ms 12540 KB Output is correct
43 Correct 143 ms 11640 KB Output is correct
44 Correct 145 ms 12024 KB Output is correct
45 Correct 138 ms 11004 KB Output is correct
46 Correct 144 ms 12332 KB Output is correct
47 Correct 117 ms 11256 KB Output is correct
48 Correct 116 ms 11740 KB Output is correct
49 Correct 127 ms 10724 KB Output is correct
50 Correct 111 ms 11640 KB Output is correct
51 Correct 118 ms 11844 KB Output is correct
52 Correct 116 ms 11512 KB Output is correct