oj.uz

Submission #33259

# Submission time Handle Problem Language Result Execution time Memory
33259 2017-10-23T07:35:29 Z minkank Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 243 ms 3576 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;

int n, m, s, t;
long long ans = 0, a[N];

int main() {
	scanf("%d %d %d %d", &n, &m, &t, &s);
	for(int i = 0; i <= n; ++i) scanf("%lld", &a[i]);
	for(int i = n; i >= 1; --i) {
		a[i] -= a[i - 1];
		if(a[i] > 0) ans -= a[i] * t;
		else ans += -a[i] * s;
	}
	for(int i = 0; i < m; ++i) {
		int l, r, x; scanf("%d %d %d", &l, &r, &x);
		if(a[l] > 0) ans += a[l] * t;
		else ans -= -a[l] * s;
		a[l] += x;
		if(a[l] > 0) ans -= a[l] * t;
		else ans += -a[l] * s;
		if(r != n) {
			if(a[r + 1] > 0) ans += a[r + 1] * t;
			else ans -= -a[r + 1] * s;
			a[r + 1] -= x; 
			if(a[r + 1] > 0) ans -= a[r + 1] * t;
			else ans += -a[r + 1] * s;
		}
		cout << ans << '\n';
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:10:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d", &n, &m, &t, &s);
                                      ^
foehn_phenomena.cpp:11:50: 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:18:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int l, r, x; scanf("%d %d %d", &l, &r, &x);
                                             ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 3576 KB Output is correct
2 Correct 179 ms 3576 KB Output is correct
3 Correct 166 ms 3576 KB Output is correct
4 Correct 166 ms 3576 KB Output is correct
5 Correct 179 ms 3576 KB Output is correct
6 Correct 143 ms 3576 KB Output is correct
7 Correct 156 ms 3576 KB Output is correct
8 Correct 153 ms 3576 KB Output is correct
9 Correct 173 ms 3576 KB Output is correct
10 Correct 193 ms 3576 KB Output is correct
11 Correct 113 ms 3576 KB Output is correct
12 Correct 119 ms 3576 KB Output is correct
13 Correct 109 ms 3576 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3576 KB Output is correct
2 Correct 0 ms 3576 KB Output is correct
3 Correct 0 ms 3576 KB Output is correct
4 Correct 0 ms 3576 KB Output is correct
5 Correct 0 ms 3576 KB Output is correct
6 Correct 0 ms 3576 KB Output is correct
7 Correct 0 ms 3576 KB Output is correct
8 Correct 0 ms 3576 KB Output is correct
9 Correct 0 ms 3576 KB Output is correct
10 Correct 0 ms 3576 KB Output is correct
11 Correct 0 ms 3576 KB Output is correct
12 Correct 0 ms 3576 KB Output is correct
13 Correct 0 ms 3576 KB Output is correct
14 Correct 0 ms 3576 KB Output is correct
15 Correct 0 ms 3576 KB Output is correct
16 Correct 0 ms 3576 KB Output is correct
17 Correct 0 ms 3576 KB Output is correct
18 Correct 0 ms 3576 KB Output is correct
19 Correct 0 ms 3576 KB Output is correct
20 Correct 0 ms 3576 KB Output is correct
21 Correct 0 ms 3576 KB Output is correct
22 Correct 173 ms 3576 KB Output is correct
23 Correct 179 ms 3576 KB Output is correct
24 Correct 166 ms 3576 KB Output is correct
25 Correct 166 ms 3576 KB Output is correct
26 Correct 179 ms 3576 KB Output is correct
27 Correct 143 ms 3576 KB Output is correct
28 Correct 156 ms 3576 KB Output is correct
29 Correct 153 ms 3576 KB Output is correct
30 Correct 173 ms 3576 KB Output is correct
31 Correct 193 ms 3576 KB Output is correct
32 Correct 113 ms 3576 KB Output is correct
33 Correct 119 ms 3576 KB Output is correct
34 Correct 109 ms 3576 KB Output is correct
35 Correct 183 ms 3576 KB Output is correct
36 Correct 179 ms 3576 KB Output is correct
37 Correct 243 ms 3576 KB Output is correct
38 Correct 146 ms 3576 KB Output is correct
39 Correct 156 ms 3576 KB Output is correct
40 Correct 199 ms 3576 KB Output is correct
41 Correct 176 ms 3576 KB Output is correct
42 Correct 179 ms 3576 KB Output is correct
43 Correct 183 ms 3576 KB Output is correct
44 Correct 223 ms 3576 KB Output is correct
45 Correct 169 ms 3576 KB Output is correct
46 Correct 193 ms 3576 KB Output is correct
47 Correct 129 ms 3576 KB Output is correct
48 Correct 139 ms 3576 KB Output is correct
49 Correct 163 ms 3576 KB Output is correct
50 Correct 113 ms 3576 KB Output is correct
51 Correct 126 ms 3576 KB Output is correct
52 Correct 133 ms 3576 KB Output is correct