oj.uz

답안 #129551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129551 2019-07-12T13:34:07 Z khanh Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 568 ms 14076 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define inf 1e15 + 7
#define N 200005
#define ll long long
using namespace std;

ll n,q,up,down;
ll arr[N] , lazy[4*N] , node[4*N];
ll ans = 0;

void build_tree(ll i,ll l,ll r) {
	if(l>r) return;
	if(l==r) {
		node[i] = arr[l];
		return;
	}
	ll m = (l + r) / 2;
	build_tree(2*i   , l , m);	m++;
	build_tree(2*i+1 , m , r);
	node[i] = max(node[2*i],node[2*i+1]);
}

void true_val(ll i,ll l,ll r) {
	if(lazy[i]==0) return;
	node[i] += lazy[i];
	if(l!=r) {
		lazy[2*i] += lazy[i];
		lazy[2*i+1] += lazy[i];
	}
	lazy[i] = 0;
}

void update(ll i,ll l,ll r,ll a,ll b,ll val) {
	true_val(i,l,r);
	if(l>r || b<l || r<a) return;
	if(a<=l && r<=b) {
		node[i] += val;
		if(l!=r) {
			lazy[i*2] += val;
			lazy[i*2+1] += val;
			return;
		}
		return;
	}
	ll m = (l + r) / 2;
	update(2*i   , l , m , a , b , val);	m++;
	update(2*i+1 , m , r , a , b , val);
	node[i] = max(node[2*i],node[2*i+1]);
}

ll get_max(ll i,ll l,ll r,ll a,ll b) {
	true_val(i,l,r);
	if(l>r || b<l || r<a) return -inf;
	if(a<=l && r<=b) return node[i];
	ll m = (l + r) / 2;
	return max(get_max(2*i,l,m,a,b),get_max(2*i+1,m+1,r,a,b));
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin>>n>>q>>down>>up;
	
	for(ll i=0;i<=n;i++) {
		cin>>arr[i];
		lazy[i] = 0;
	}
	
	build_tree(1,1,n);
	
	for(ll i=0;i<=n-1;i++) {
		if(arr[i] < arr[i+1]) ans -= down * abs(arr[i] - arr[i+1]);
		else ans += up * abs(arr[i] - arr[i+1]);
	}
	
	while(q--) {
		ll l,r,x;	cin>>l>>r>>x;
			
		ll l1 = (l==1 ? 0 : get_max(1,1,n,l-1,l-1));
		ll l2 = get_max(1,1,n,l,l);
			
		if(l1<l2) ans += down * (l2-l1);
			
		if(l1 >= l2) ans -= up * (l1-l2);
			
		if(l1 >= l2 + x) {
			ans += up * (l1-l2-x);
		}
		if(l1 < l2 + x) {
			ans -= down * (l2+x-l1);
		}
		
		if(r <= n - 1) {
			ll r1 = get_max(1,1,n,r,r);
			ll r2 = get_max(1,1,n,r+1,r+1);
			
			if(r1<r2) ans += down*(r2-r1);
			if(r1>=r2) ans -= up*(r1-r2);
			
			if(r1+x<r2) ans -= down*(r2-r1-x);
			if(r1+x>=r2) ans += up * (r1+x-r2);
		}
		cout<<ans<<"\n";
		update(1,1,n,l,r,x);
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 8 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 511 ms 11616 KB Output is correct
2 Correct 526 ms 12212 KB Output is correct
3 Correct 549 ms 12884 KB Output is correct
4 Correct 518 ms 11972 KB Output is correct
5 Correct 523 ms 12828 KB Output is correct
6 Correct 161 ms 10616 KB Output is correct
7 Correct 161 ms 10616 KB Output is correct
8 Correct 452 ms 13176 KB Output is correct
9 Correct 440 ms 13484 KB Output is correct
10 Correct 430 ms 12156 KB Output is correct
11 Correct 274 ms 10840 KB Output is correct
12 Correct 160 ms 11008 KB Output is correct
13 Correct 226 ms 11384 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 8 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 4 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 511 ms 11616 KB Output is correct
23 Correct 526 ms 12212 KB Output is correct
24 Correct 549 ms 12884 KB Output is correct
25 Correct 518 ms 11972 KB Output is correct
26 Correct 523 ms 12828 KB Output is correct
27 Correct 161 ms 10616 KB Output is correct
28 Correct 161 ms 10616 KB Output is correct
29 Correct 452 ms 13176 KB Output is correct
30 Correct 440 ms 13484 KB Output is correct
31 Correct 430 ms 12156 KB Output is correct
32 Correct 274 ms 10840 KB Output is correct
33 Correct 160 ms 11008 KB Output is correct
34 Correct 226 ms 11384 KB Output is correct
35 Correct 518 ms 11716 KB Output is correct
36 Correct 528 ms 13268 KB Output is correct
37 Correct 524 ms 14076 KB Output is correct
38 Correct 516 ms 13688 KB Output is correct
39 Correct 522 ms 13752 KB Output is correct
40 Correct 524 ms 13816 KB Output is correct
41 Correct 568 ms 13560 KB Output is correct
42 Correct 559 ms 13688 KB Output is correct
43 Correct 521 ms 12940 KB Output is correct
44 Correct 524 ms 13412 KB Output is correct
45 Correct 514 ms 13176 KB Output is correct
46 Correct 524 ms 13804 KB Output is correct
47 Correct 166 ms 11212 KB Output is correct
48 Correct 267 ms 11328 KB Output is correct
49 Correct 512 ms 13076 KB Output is correct
50 Correct 275 ms 11128 KB Output is correct
51 Correct 160 ms 11128 KB Output is correct
52 Correct 321 ms 11176 KB Output is correct