oj.uz

Submission #33250

# Submission time Handle Problem Language Result Execution time Memory
33250 2017-10-23T07:20:56 Z ngkan146 Foehn Phenomena (JOI17_foehn_phenomena) C++
100 / 100
 229 ms 5140 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,q,s,t;
ll a[200005], b[200005];
int main(){
	scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
	for(int i=0;i<=n;i++)	scanf("%lld",&a[i]);
	for(int i=1;i<=n;i++)	b[i] = a[i] - a[i-1];
	ll res = 0;
	for(int i=1;i<=n;i++)
		if (b[i] <= 0) res += t * abs(b[i]);
		else res -= s * b[i];
	while(q--){
		int l,r,x;
		scanf("%d %d %d",&l,&r,&x);
		if (b[l] <= 0) res -= t * abs(b[l]);
		else res += s * b[l];
		b[l] += x;
		if (b[l] <= 0) res += t * abs(b[l]);
		else res -= s * b[l];
		
		if (r+1 <= n){
			if (b[r+1] <= 0) res -= t * abs(b[r+1]);
			else res += s * b[r+1];
			b[r+1] -= x;
			if (b[r+1] <= 0) res += t * abs(b[r+1]);
			else res -= s * b[r+1];
		}
		printf("%lld\n",res);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:7:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
                                          ^
foehn_phenomena.cpp:8:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<=n;i++) scanf("%lld",&a[i]);
                                           ^
foehn_phenomena.cpp:16:29: 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 0 ms 5140 KB Output is correct
2 Correct 3 ms 5140 KB Output is correct
3 Correct 0 ms 5140 KB Output is correct
4 Correct 0 ms 5140 KB Output is correct
5 Correct 0 ms 5140 KB Output is correct
6 Correct 0 ms 5140 KB Output is correct
7 Correct 0 ms 5140 KB Output is correct
8 Correct 0 ms 5140 KB Output is correct
9 Correct 0 ms 5140 KB Output is correct
10 Correct 0 ms 5140 KB Output is correct
11 Correct 0 ms 5140 KB Output is correct
12 Correct 0 ms 5140 KB Output is correct
13 Correct 0 ms 5140 KB Output is correct
14 Correct 0 ms 5140 KB Output is correct
15 Correct 0 ms 5140 KB Output is correct
16 Correct 0 ms 5140 KB Output is correct
17 Correct 0 ms 5140 KB Output is correct
18 Correct 0 ms 5140 KB Output is correct
19 Correct 0 ms 5140 KB Output is correct
20 Correct 0 ms 5140 KB Output is correct
21 Correct 0 ms 5140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 5140 KB Output is correct
2 Correct 199 ms 5140 KB Output is correct
3 Correct 203 ms 5140 KB Output is correct
4 Correct 166 ms 5140 KB Output is correct
5 Correct 163 ms 5140 KB Output is correct
6 Correct 129 ms 5140 KB Output is correct
7 Correct 119 ms 5140 KB Output is correct
8 Correct 203 ms 5140 KB Output is correct
9 Correct 229 ms 5140 KB Output is correct
10 Correct 196 ms 5140 KB Output is correct
11 Correct 136 ms 5140 KB Output is correct
12 Correct 113 ms 5140 KB Output is correct
13 Correct 129 ms 5140 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5140 KB Output is correct
2 Correct 3 ms 5140 KB Output is correct
3 Correct 0 ms 5140 KB Output is correct
4 Correct 0 ms 5140 KB Output is correct
5 Correct 0 ms 5140 KB Output is correct
6 Correct 0 ms 5140 KB Output is correct
7 Correct 0 ms 5140 KB Output is correct
8 Correct 0 ms 5140 KB Output is correct
9 Correct 0 ms 5140 KB Output is correct
10 Correct 0 ms 5140 KB Output is correct
11 Correct 0 ms 5140 KB Output is correct
12 Correct 0 ms 5140 KB Output is correct
13 Correct 0 ms 5140 KB Output is correct
14 Correct 0 ms 5140 KB Output is correct
15 Correct 0 ms 5140 KB Output is correct
16 Correct 0 ms 5140 KB Output is correct
17 Correct 0 ms 5140 KB Output is correct
18 Correct 0 ms 5140 KB Output is correct
19 Correct 0 ms 5140 KB Output is correct
20 Correct 0 ms 5140 KB Output is correct
21 Correct 0 ms 5140 KB Output is correct
22 Correct 213 ms 5140 KB Output is correct
23 Correct 199 ms 5140 KB Output is correct
24 Correct 203 ms 5140 KB Output is correct
25 Correct 166 ms 5140 KB Output is correct
26 Correct 163 ms 5140 KB Output is correct
27 Correct 129 ms 5140 KB Output is correct
28 Correct 119 ms 5140 KB Output is correct
29 Correct 203 ms 5140 KB Output is correct
30 Correct 229 ms 5140 KB Output is correct
31 Correct 196 ms 5140 KB Output is correct
32 Correct 136 ms 5140 KB Output is correct
33 Correct 113 ms 5140 KB Output is correct
34 Correct 129 ms 5140 KB Output is correct
35 Correct 196 ms 5140 KB Output is correct
36 Correct 193 ms 5140 KB Output is correct
37 Correct 209 ms 5140 KB Output is correct
38 Correct 183 ms 5140 KB Output is correct
39 Correct 189 ms 5140 KB Output is correct
40 Correct 193 ms 5140 KB Output is correct
41 Correct 203 ms 5140 KB Output is correct
42 Correct 179 ms 5140 KB Output is correct
43 Correct 169 ms 5140 KB Output is correct
44 Correct 166 ms 5140 KB Output is correct
45 Correct 143 ms 5140 KB Output is correct
46 Correct 196 ms 5140 KB Output is correct
47 Correct 133 ms 5140 KB Output is correct
48 Correct 113 ms 5140 KB Output is correct
49 Correct 183 ms 5140 KB Output is correct
50 Correct 103 ms 5140 KB Output is correct
51 Correct 133 ms 5140 KB Output is correct
52 Correct 133 ms 5140 KB Output is correct