oj.uz

Submission #51454

# Submission time Handle Problem Language Result Execution time Memory
51454 2018-06-18T03:12:04 Z FutymyClone Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 191 ms 7508 KB 
#include <bits/stdc++.h>
using namespace std;

long long n, q, s, t, d[200010], a[200010], del, l, r, T0 = 0;
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++) {
		d[i] = a[i] - a[i-1];
		T0 += (d[i] >= 0 ? -d[i] * s : -d[i] * t);
	}
	while(q--) {
		scanf("%lld%lld%lld", &l, &r, &del);
		long long T = 0; T0 -= (d[l] >= 0 ? -d[l] * s : -d[l] * t);
		d[l] += del;
		T0 += (d[l] >= 0 ? -d[l] * s : -d[l] * t);
		if(r < n) {
			T0 -= (d[r+1] >= 0 ? -d[r+1] * s : -d[r+1] * t);
			d[r+1] -= del;
			T0 += (d[r+1] >= 0 ? -d[r+1] * s : -d[r+1] * t);
		}
		printf("%lld\n", T0);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:14:13: warning: unused variable 'T' [-Wunused-variable]
   long long T = 0; T0 -= (d[l] >= 0 ? -d[l] * s : -d[l] * t);
             ^
foehn_phenomena.cpp:6:7: 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:7:35: 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:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &l, &r, &del);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 380 KB Output is correct
2 Correct 4 ms 380 KB Output is correct
3 Correct 4 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 5 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 4 ms 628 KB Output is correct
9 Correct 4 ms 628 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 3 ms 720 KB Output is correct
12 Correct 3 ms 720 KB Output is correct
13 Correct 4 ms 720 KB Output is correct
14 Correct 3 ms 720 KB Output is correct
15 Correct 4 ms 720 KB Output is correct
16 Correct 4 ms 720 KB Output is correct
17 Correct 3 ms 720 KB Output is correct
18 Correct 3 ms 720 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 3 ms 720 KB Output is correct
21 Correct 3 ms 720 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 5184 KB Output is correct
2 Correct 173 ms 5760 KB Output is correct
3 Correct 185 ms 6332 KB Output is correct
4 Correct 143 ms 6332 KB Output is correct
5 Correct 147 ms 6332 KB Output is correct
6 Correct 150 ms 6660 KB Output is correct
7 Correct 130 ms 6660 KB Output is correct
8 Correct 170 ms 6716 KB Output is correct
9 Correct 183 ms 7100 KB Output is correct
10 Correct 184 ms 7100 KB Output is correct
11 Correct 109 ms 7100 KB Output is correct
12 Correct 118 ms 7100 KB Output is correct
13 Correct 140 ms 7484 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 380 KB Output is correct
2 Correct 4 ms 380 KB Output is correct
3 Correct 4 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 5 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 4 ms 628 KB Output is correct
9 Correct 4 ms 628 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 3 ms 720 KB Output is correct
12 Correct 3 ms 720 KB Output is correct
13 Correct 4 ms 720 KB Output is correct
14 Correct 3 ms 720 KB Output is correct
15 Correct 4 ms 720 KB Output is correct
16 Correct 4 ms 720 KB Output is correct
17 Correct 3 ms 720 KB Output is correct
18 Correct 3 ms 720 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 3 ms 720 KB Output is correct
21 Correct 3 ms 720 KB Output is correct
22 Correct 171 ms 5184 KB Output is correct
23 Correct 173 ms 5760 KB Output is correct
24 Correct 185 ms 6332 KB Output is correct
25 Correct 143 ms 6332 KB Output is correct
26 Correct 147 ms 6332 KB Output is correct
27 Correct 150 ms 6660 KB Output is correct
28 Correct 130 ms 6660 KB Output is correct
29 Correct 170 ms 6716 KB Output is correct
30 Correct 183 ms 7100 KB Output is correct
31 Correct 184 ms 7100 KB Output is correct
32 Correct 109 ms 7100 KB Output is correct
33 Correct 118 ms 7100 KB Output is correct
34 Correct 140 ms 7484 KB Output is correct
35 Correct 170 ms 7484 KB Output is correct
36 Correct 168 ms 7484 KB Output is correct
37 Correct 191 ms 7508 KB Output is correct
38 Correct 168 ms 7508 KB Output is correct
39 Correct 170 ms 7508 KB Output is correct
40 Correct 163 ms 7508 KB Output is correct
41 Correct 163 ms 7508 KB Output is correct
42 Correct 164 ms 7508 KB Output is correct
43 Correct 165 ms 7508 KB Output is correct
44 Correct 174 ms 7508 KB Output is correct
45 Correct 147 ms 7508 KB Output is correct
46 Correct 156 ms 7508 KB Output is correct
47 Correct 127 ms 7508 KB Output is correct
48 Correct 130 ms 7508 KB Output is correct
49 Correct 144 ms 7508 KB Output is correct
50 Correct 151 ms 7508 KB Output is correct
51 Correct 123 ms 7508 KB Output is correct
52 Correct 125 ms 7508 KB Output is correct