oj.uz

Submission #129281

# Submission time Handle Problem Language Result Execution time Memory
129281 2019-07-12T01:51:52 Z hungcung Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 204 ms 6464 KB 
#include<bits/stdc++.h>
using namespace std;
int n,q,s,t,l,r,x,a[200005];
long long b[200005];
int main(){
	scanf("%d %d %d %d",&n,&q,&s,&t);
	for(int i=0;i<=n;i++){
		scanf("%d",&a[i]);
	}
	long long ans=0;
	for(int i=1;i<=n;i++){
		b[i]=a[i-1]-a[i];
		if(b[i]<0) ans+=s*b[i];
		else ans+=t*b[i];
	}
	while(q--){
		scanf("%d %d %d",&l,&r,&x);
		if(b[l]<0) ans-=s*b[l];
		else ans-=t*b[l];
		b[l]-=x;
		if(b[l]<0) ans+=s*b[l];
		else ans+=t*b[l];
		if(r<n){
			if(b[r+1]<0) ans-=s*b[r+1];
			else ans-=t*b[r+1];
			b[r+1]+=x;
			if(b[r+1]<0) ans+=s*b[r+1];
			else ans+=t*b[r+1];
		}
		printf("%lld\n",ans);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&n,&q,&s,&t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&l,&r,&x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 420 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 256 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 171 ms 4048 KB Output is correct
2 Correct 166 ms 4648 KB Output is correct
3 Correct 204 ms 5240 KB Output is correct
4 Correct 141 ms 4384 KB Output is correct
5 Correct 147 ms 5240 KB Output is correct
6 Correct 129 ms 5648 KB Output is correct
7 Correct 129 ms 5592 KB Output is correct
8 Correct 164 ms 5684 KB Output is correct
9 Correct 162 ms 5824 KB Output is correct
10 Correct 162 ms 4684 KB Output is correct
11 Correct 111 ms 5628 KB Output is correct
12 Correct 125 ms 6136 KB Output is correct
13 Correct 126 ms 6464 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 420 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 171 ms 4048 KB Output is correct
23 Correct 166 ms 4648 KB Output is correct
24 Correct 204 ms 5240 KB Output is correct
25 Correct 141 ms 4384 KB Output is correct
26 Correct 147 ms 5240 KB Output is correct
27 Correct 129 ms 5648 KB Output is correct
28 Correct 129 ms 5592 KB Output is correct
29 Correct 164 ms 5684 KB Output is correct
30 Correct 162 ms 5824 KB Output is correct
31 Correct 162 ms 4684 KB Output is correct
32 Correct 111 ms 5628 KB Output is correct
33 Correct 125 ms 6136 KB Output is correct
34 Correct 126 ms 6464 KB Output is correct
35 Correct 163 ms 4308 KB Output is correct
36 Correct 164 ms 5604 KB Output is correct
37 Correct 170 ms 6392 KB Output is correct
38 Correct 173 ms 6288 KB Output is correct
39 Correct 167 ms 6264 KB Output is correct
40 Correct 171 ms 6296 KB Output is correct
41 Correct 169 ms 6136 KB Output is correct
42 Correct 167 ms 6136 KB Output is correct
43 Correct 161 ms 5496 KB Output is correct
44 Correct 162 ms 5924 KB Output is correct
45 Correct 145 ms 5624 KB Output is correct
46 Correct 150 ms 6364 KB Output is correct
47 Correct 131 ms 6392 KB Output is correct
48 Correct 129 ms 6392 KB Output is correct
49 Correct 141 ms 5500 KB Output is correct
50 Correct 113 ms 6264 KB Output is correct
51 Correct 122 ms 6284 KB Output is correct
52 Correct 126 ms 6264 KB Output is correct