Submission #114262

# Submission time Handle Problem Language Result Execution time Memory
114262 2019-05-31T15:57:30 Z kimjg1119 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
188 ms 11484 KB
#include <bits/stdc++.h>
#define MAXN 200005

using namespace std;
typedef long long ll;

ll sig[MAXN];
ll n, q, s, t, temp = 0;

ll pre(ll k) {
	if (k >= 0) return -s * k;
	else return -t * k;
}

ll func(ll pos, ll diff) {
	ll a = pre(sig[pos]), b = pre(sig[pos] + diff);
	return b - a;
}

int main() {
	scanf("%lld %lld %lld %lld", &n, &q, &s, &t);
	ll bf; scanf("%lld", &bf);
	for (int i = 1; i <= n; i++) {
		ll tz;
		scanf("%lld", &tz);
		sig[i] = tz - bf;
		bf = tz;
		if (sig[i] >= 0) temp -= sig[i] * s;
		else temp -= sig[i] * t;
	}
	while (q--) {
		ll x, y, diff, ord;
		scanf("%lld %lld %lld", &x, &y, &diff);

		temp += func(x, diff);
		sig[x] += diff;
		if (y == n) diff = 0;
		temp += func(y + 1, -diff);
		sig[y + 1] -= diff;

		printf("%lld\n", temp);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:32:18: warning: unused variable 'ord' [-Wunused-variable]
   ll x, y, diff, ord;
                  ^~~
foehn_phenomena.cpp:21: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:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  ll bf; scanf("%lld", &bf);
         ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &tz);
   ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld", &x, &y, &diff);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 139 ms 8760 KB Output is correct
2 Correct 141 ms 9464 KB Output is correct
3 Correct 144 ms 9848 KB Output is correct
4 Correct 127 ms 9336 KB Output is correct
5 Correct 128 ms 10336 KB Output is correct
6 Correct 107 ms 9464 KB Output is correct
7 Correct 108 ms 9464 KB Output is correct
8 Correct 144 ms 10360 KB Output is correct
9 Correct 141 ms 10712 KB Output is correct
10 Correct 141 ms 9336 KB Output is correct
11 Correct 96 ms 9228 KB Output is correct
12 Correct 134 ms 9976 KB Output is correct
13 Correct 113 ms 10232 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 139 ms 8760 KB Output is correct
23 Correct 141 ms 9464 KB Output is correct
24 Correct 144 ms 9848 KB Output is correct
25 Correct 127 ms 9336 KB Output is correct
26 Correct 128 ms 10336 KB Output is correct
27 Correct 107 ms 9464 KB Output is correct
28 Correct 108 ms 9464 KB Output is correct
29 Correct 144 ms 10360 KB Output is correct
30 Correct 141 ms 10712 KB Output is correct
31 Correct 141 ms 9336 KB Output is correct
32 Correct 96 ms 9228 KB Output is correct
33 Correct 134 ms 9976 KB Output is correct
34 Correct 113 ms 10232 KB Output is correct
35 Correct 138 ms 8896 KB Output is correct
36 Correct 188 ms 10232 KB Output is correct
37 Correct 159 ms 11000 KB Output is correct
38 Correct 153 ms 10744 KB Output is correct
39 Correct 165 ms 10872 KB Output is correct
40 Correct 155 ms 10872 KB Output is correct
41 Correct 186 ms 10744 KB Output is correct
42 Correct 165 ms 10744 KB Output is correct
43 Correct 145 ms 10116 KB Output is correct
44 Correct 176 ms 10492 KB Output is correct
45 Correct 131 ms 10616 KB Output is correct
46 Correct 132 ms 11484 KB Output is correct
47 Correct 112 ms 10076 KB Output is correct
48 Correct 109 ms 10120 KB Output is correct
49 Correct 132 ms 9080 KB Output is correct
50 Correct 111 ms 9820 KB Output is correct
51 Correct 109 ms 10232 KB Output is correct
52 Correct 106 ms 10032 KB Output is correct