oj.uz

Submission #317262

# Submission time Handle Problem Language Result Execution time Memory
317262 2020-10-29T08:32:53 Z nandonathaniel Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 652 ms 19832 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MAXN=200005;

LL tree[4*MAXN],lazy[4*MAXN];
LL A[MAXN];

void updatenode(LL now,LL L,LL R,LL val){
	tree[now]+=((R-L+1)*val);
	lazy[now]+=val;
}


void pushdown(LL now,LL L,LL R){
	LL mid=(L+R)/2;
	updatenode(2*now,L,mid,lazy[now]);
	updatenode(2*now+1,mid+1,R,lazy[now]);
	lazy[now]=0;
}

void build(LL now,LL L,LL R){
	if(L==R){
		tree[now]=A[L];
		return;
	}
	LL mid=(L+R)/2;
	build(2*now,L,mid);
	build(2*now+1,mid+1,R);
	tree[now]=tree[2*now]+tree[2*now+1];
}

LL query(LL now,LL L,LL R,LL x,LL y){
	if(L>=x && R<=y)return tree[now];
	if(L>y || R<x)return 0;
	pushdown(now,L,R);
	LL mid=(L+R)/2;
	return query(2*now,L,mid,x,y)+query(2*now+1,mid+1,R,x,y);
}

void update(LL now,LL L,LL R,LL x,LL y,LL val){
	if(L>=x && R<=y){
		updatenode(now,L,R,val);
		return;
	}
	if(L>y || R<x)return;
	LL mid=(L+R)/2;
	pushdown(now,L,R);
	update(2*now,L,mid,x,y,val);
	update(2*now+1,mid+1,R,x,y,val);
	tree[now]=tree[2*now]+tree[2*now+1];
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	LL N,Q,S,T,L,R,P,U,V,W,X;
	cin >> N >> Q >> S >> T;
	for(LL i=0;i<=N;i++)cin >> A[i];
	build(1,1,N);
	LL ans=0;
	for(LL i=1;i<=N;i++){
		if(A[i-1]<=A[i])ans-=(S*(A[i]-A[i-1]));
		else ans+=(T*(A[i-1]-A[i]));
	}
	while(Q--){
		cin >> L >> R >> P;
		LL U=0,V=query(1,1,N,L,L);
		if(L>=2)U=query(1,1,N,L-1,L-1);
		if(U<=V)ans+=(S*(V-U));
		else ans-=(T*(U-V));
		LL W=query(1,1,N,R,R),X;
		if(R+1<=N){
			X=query(1,1,N,R+1,R+1);
			if(W<=X)ans+=(S*(X-W));
			else ans-=(T*(W-X));
		}
		update(1,1,N,L,R,P);
		V=query(1,1,N,L,L);
		W=query(1,1,N,R,R);
		if(U<=V)ans-=(S*(V-U));
		else ans+=(T*(U-V));
		if(R+1<=N){
			if(W<=X)ans-=(S*(X-W));
			else ans+=(T*(W-X));
		}
		cout << ans << '\n';
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:56:19: warning: unused variable 'U' [-Wunused-variable]
   56 |  LL N,Q,S,T,L,R,P,U,V,W,X;
      |                   ^
foehn_phenomena.cpp:56:21: warning: unused variable 'V' [-Wunused-variable]
   56 |  LL N,Q,S,T,L,R,P,U,V,W,X;
      |                     ^
foehn_phenomena.cpp:56:23: warning: unused variable 'W' [-Wunused-variable]
   56 |  LL N,Q,S,T,L,R,P,U,V,W,X;
      |                       ^
foehn_phenomena.cpp:56:25: warning: unused variable 'X' [-Wunused-variable]
   56 |  LL N,Q,S,T,L,R,P,U,V,W,X;
      |                         ^
foehn_phenomena.cpp:84:19: warning: 'X' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |    else ans+=(T*(W-X));
      |                 ~~^~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 11624 KB Output is correct
2 Correct 633 ms 12352 KB Output is correct
3 Correct 636 ms 12920 KB Output is correct
4 Correct 623 ms 11896 KB Output is correct
5 Correct 635 ms 18808 KB Output is correct
6 Correct 269 ms 13688 KB Output is correct
7 Correct 269 ms 13760 KB Output is correct
8 Correct 556 ms 18552 KB Output is correct
9 Correct 549 ms 18936 KB Output is correct
10 Correct 547 ms 17696 KB Output is correct
11 Correct 425 ms 13688 KB Output is correct
12 Correct 270 ms 14292 KB Output is correct
13 Correct 370 ms 14584 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 544 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 632 ms 11624 KB Output is correct
23 Correct 633 ms 12352 KB Output is correct
24 Correct 636 ms 12920 KB Output is correct
25 Correct 623 ms 11896 KB Output is correct
26 Correct 635 ms 18808 KB Output is correct
27 Correct 269 ms 13688 KB Output is correct
28 Correct 269 ms 13760 KB Output is correct
29 Correct 556 ms 18552 KB Output is correct
30 Correct 549 ms 18936 KB Output is correct
31 Correct 547 ms 17696 KB Output is correct
32 Correct 425 ms 13688 KB Output is correct
33 Correct 270 ms 14292 KB Output is correct
34 Correct 370 ms 14584 KB Output is correct
35 Correct 640 ms 17272 KB Output is correct
36 Correct 640 ms 18804 KB Output is correct
37 Correct 641 ms 19368 KB Output is correct
38 Correct 640 ms 19352 KB Output is correct
39 Correct 652 ms 19192 KB Output is correct
40 Correct 650 ms 19192 KB Output is correct
41 Correct 647 ms 19140 KB Output is correct
42 Correct 646 ms 19212 KB Output is correct
43 Correct 643 ms 18300 KB Output is correct
44 Correct 639 ms 18936 KB Output is correct
45 Correct 635 ms 18808 KB Output is correct
46 Correct 638 ms 19832 KB Output is correct
47 Correct 273 ms 14328 KB Output is correct
48 Correct 384 ms 14440 KB Output is correct
49 Correct 618 ms 17400 KB Output is correct
50 Correct 425 ms 14200 KB Output is correct
51 Correct 270 ms 14456 KB Output is correct
52 Correct 476 ms 14476 KB Output is correct