oj.uz

답안 #525649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525649 2022-02-12T09:01:42 Z Gurban Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 349 ms 19004 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=2e5+5;
int n,q,s,t;
int a[maxn];
ll T[4 * maxn][2];

void prop(int nd){
	if(!T[nd][1]) return;
	T[nd<<1][0] += T[nd][1];
	T[nd<<1][1] += T[nd][1];
	T[nd<<1 | 1][0] += T[nd][1];
	T[nd<<1 | 1][1] += T[nd][1];
	T[nd][1] = 0;
}

void upd(int a,int b,int val,int l,int r,int nd){
	if(r < a or l > b) return;
	if(l >= a and r <= b){
		T[nd][0] += val;
		T[nd][1] += val;
		return;
	}
	int md = (l + r) >> 1;
	prop(nd);
	upd(a,b,val,l,md,nd<<1);
	upd(a,b,val,md+1,r,nd<<1 | 1);
}

ll tap(int pos,int l,int r,int nd){
	if(l == r) return T[nd][0];
	prop(nd);
	int md = (l + r) >> 1;
	if(pos <= md) return tap(pos,l,md,nd<<1);
	return tap(pos,md+1,r,nd<<1 | 1);
}

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

	cin >> n >> q >> s >> t;
	for(int i = 0;i <= n;i++){
		cin >> a[i];
		upd(i,i,a[i],0,n,1);
	}
	ll jog = 0;
	for(int i = 0;i < n;i++){
		if(a[i + 1] > a[i]) jog -= 1ll * s * (a[i + 1] - a[i]);
		else jog += 1ll * t * (a[i] - a[i + 1]);
	}

	// cout<<jog<<'\n';

	while(q--){
		int l,r,x; cin >> l >> r >> x;
		ll lft = tap(l-1,0,n,1);
		ll cep = tap(l,0,n,1);
		ll sag = tap(r,0,n,1);
		ll rgt = tap(r + 1,0,n,1);
		
		// cout<<lft<<' '<<cep<<' '<<sag<<' '<<rgt<<'\n';

		if(lft < cep) jog += 1ll * s * (cep - lft);
		else jog -= 1ll * t * (lft - cep);


		if(r + 1 <= n){
			if(sag < rgt) jog += 1ll * s * (rgt - sag);
			else jog -= 1ll * t * (sag - rgt);
		}
		upd(l,r,x,0,n,1);

		if(lft < cep + x){
			jog -= 1ll * s * (cep + x - lft);
		}
		else jog += 1ll * t * (lft - cep - x);
		

		if(r + 1 <= n){
			if(rgt > sag + x){
				jog -= 1ll * s * (rgt - x - sag);
			}
			else jog += 1ll * t * (sag + x - rgt);
		}
		cout<<jog<<'\n';
	}
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 464 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 4 ms 404 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 321 ms 16244 KB Output is correct
2 Correct 326 ms 16708 KB Output is correct
3 Correct 326 ms 17472 KB Output is correct
4 Correct 306 ms 16680 KB Output is correct
5 Correct 331 ms 17848 KB Output is correct
6 Correct 184 ms 14904 KB Output is correct
7 Correct 214 ms 14820 KB Output is correct
8 Correct 286 ms 17692 KB Output is correct
9 Correct 307 ms 17968 KB Output is correct
10 Correct 275 ms 16684 KB Output is correct
11 Correct 202 ms 14712 KB Output is correct
12 Correct 191 ms 15596 KB Output is correct
13 Correct 189 ms 15808 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 464 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 464 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 4 ms 404 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 321 ms 16244 KB Output is correct
23 Correct 326 ms 16708 KB Output is correct
24 Correct 326 ms 17472 KB Output is correct
25 Correct 306 ms 16680 KB Output is correct
26 Correct 331 ms 17848 KB Output is correct
27 Correct 184 ms 14904 KB Output is correct
28 Correct 214 ms 14820 KB Output is correct
29 Correct 286 ms 17692 KB Output is correct
30 Correct 307 ms 17968 KB Output is correct
31 Correct 275 ms 16684 KB Output is correct
32 Correct 202 ms 14712 KB Output is correct
33 Correct 191 ms 15596 KB Output is correct
34 Correct 189 ms 15808 KB Output is correct
35 Correct 323 ms 16268 KB Output is correct
36 Correct 308 ms 17644 KB Output is correct
37 Correct 321 ms 18460 KB Output is correct
38 Correct 318 ms 18236 KB Output is correct
39 Correct 327 ms 18232 KB Output is correct
40 Correct 320 ms 18268 KB Output is correct
41 Correct 349 ms 18264 KB Output is correct
42 Correct 335 ms 18272 KB Output is correct
43 Correct 309 ms 17504 KB Output is correct
44 Correct 317 ms 17860 KB Output is correct
45 Correct 333 ms 17928 KB Output is correct
46 Correct 331 ms 19004 KB Output is correct
47 Correct 217 ms 15544 KB Output is correct
48 Correct 193 ms 15424 KB Output is correct
49 Correct 325 ms 16520 KB Output is correct
50 Correct 196 ms 15300 KB Output is correct
51 Correct 193 ms 15792 KB Output is correct
52 Correct 262 ms 15432 KB Output is correct