oj.uz

Submission #900785

# Submission time Handle Problem Language Result Execution time Memory
900785 2024-01-09T03:56:41 Z Isam Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 327 ms 22932 KB 
#include<bits/stdc++.h>
using namespace std;
constexpr int sz = 200005;

int N, Q, S, T, A[sz];
long long sm, Temp[sz], tree[sz << 2], lazy[sz << 2];

inline void build(int l, int r, int node){
	if(l == r){
		tree[node] = A[l];
		return;
	}
	int mid = l + ((r - l) >> 1);
	build(l, mid, node << 1);
	build(mid + 1, r, node << 1 | 1);
	tree[node] = tree[node << 1] + tree[node << 1 | 1];
	return;
}

inline void relax(int node, int l, int r){
	if(l != r){
		lazy[node << 1] += lazy[node];
		lazy[node << 1 | 1] += lazy[node];
	}
	tree[node] += 1ll * (r - l + 1) * lazy[node];
	lazy[node] = 0ll;
	return;
}

inline void update(int l, int r, int node, int L, int R, int val){
	if(lazy[node]) relax(node, l, r);
	if(l > R || r < L || r < l) return;
	if(l >= L && r <= R){
		lazy[node] += val;
		relax(node, l, r);
		return;
	}
	int mid = l + ((r - l) >> 1);
	update(l, mid, node << 1, L, R, val);
	update(mid + 1, r, node << 1 | 1, L, R, val);
	tree[node] = tree[node << 1] + tree[node << 1 | 1];
	return;
}

long long get_ans(int l, int r, int node, int L, int R){
	if(l > R || r < L || r < l) return 0ll;
	if(lazy[node]) relax(node, l, r);
	if(l >= L && r <= R) return tree[node];
	int mid = l + ((r - l) >> 1);
	return get_ans(l, mid, node << 1, L, R) + get_ans(mid + 1, r, node << 1 | 1, L, R);
}

signed main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> N >> Q >> S >> T;
	for(register int i = 0; i <= N; ++i) cin >> A[i];
	build(1, N, 1);
	function<void(int, long long)> Update = [&](int pos, long long val){
		if(!(pos >= 1 && pos <= N)) return;
		sm -= Temp[pos];
		if(val < 0){
			Temp[pos] = 1ll * val * S;
		}else{
			Temp[pos] = 1ll * val * T;
		}
		sm += Temp[pos];
	};
	for(register int i = 1; i <= N; ++i) Update(i, A[i - 1] - A[i]);
	int L, R, X;
	while(Q--){
		cin >> L >> R>> X;
		update(1, N, 1, L, R, X);
		Update(L, get_ans(1, N, 1, L - 1, L - 1) - get_ans(1, N, 1, L, L));
		Update(R + 1, get_ans(1, N, 1, R, R) - get_ans(1, N, 1, R + 1, R + 1));
		cout << sm << '\n';
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:56:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   56 |  for(register int i = 0; i <= N; ++i) cin >> A[i];
      |                   ^
foehn_phenomena.cpp:68:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |  for(register int i = 1; i <= N; ++i) Update(i, A[i - 1] - A[i]);
      |                   ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 14488 KB Output is correct
2 Correct 296 ms 15020 KB Output is correct
3 Correct 312 ms 15868 KB Output is correct
4 Correct 284 ms 14860 KB Output is correct
5 Correct 307 ms 15480 KB Output is correct
6 Correct 111 ms 13908 KB Output is correct
7 Correct 110 ms 13904 KB Output is correct
8 Correct 254 ms 16252 KB Output is correct
9 Correct 255 ms 16208 KB Output is correct
10 Correct 257 ms 14820 KB Output is correct
11 Correct 167 ms 11824 KB Output is correct
12 Correct 109 ms 14348 KB Output is correct
13 Correct 161 ms 17584 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4852 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4440 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 3 ms 4440 KB Output is correct
9 Correct 3 ms 4444 KB Output is correct
10 Correct 3 ms 4444 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 3 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 3 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 309 ms 14488 KB Output is correct
23 Correct 296 ms 15020 KB Output is correct
24 Correct 312 ms 15868 KB Output is correct
25 Correct 284 ms 14860 KB Output is correct
26 Correct 307 ms 15480 KB Output is correct
27 Correct 111 ms 13908 KB Output is correct
28 Correct 110 ms 13904 KB Output is correct
29 Correct 254 ms 16252 KB Output is correct
30 Correct 255 ms 16208 KB Output is correct
31 Correct 257 ms 14820 KB Output is correct
32 Correct 167 ms 11824 KB Output is correct
33 Correct 109 ms 14348 KB Output is correct
34 Correct 161 ms 17584 KB Output is correct
35 Correct 294 ms 19880 KB Output is correct
36 Correct 308 ms 21496 KB Output is correct
37 Correct 302 ms 22356 KB Output is correct
38 Correct 326 ms 21960 KB Output is correct
39 Correct 298 ms 22060 KB Output is correct
40 Correct 304 ms 22356 KB Output is correct
41 Correct 301 ms 21844 KB Output is correct
42 Correct 304 ms 22356 KB Output is correct
43 Correct 297 ms 21328 KB Output is correct
44 Correct 314 ms 21548 KB Output is correct
45 Correct 297 ms 21880 KB Output is correct
46 Correct 327 ms 22932 KB Output is correct
47 Correct 113 ms 19256 KB Output is correct
48 Correct 158 ms 17148 KB Output is correct
49 Correct 298 ms 20372 KB Output is correct
50 Correct 168 ms 16980 KB Output is correct
51 Correct 112 ms 19288 KB Output is correct
52 Correct 192 ms 19284 KB Output is correct