oj.uz

Submission #38042

# Submission time Handle Problem Language Result Execution time Memory
38042 2017-12-31T00:42:04 Z MatheusLealV Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 276 ms 5140 KB 
#include <bits/stdc++.h>
#define inf 200000000000000000LL
#define N 200050
using namespace std;
typedef long long ll;

int n, q;

ll A[N], bit[N], ans, S, T;

void upd(int l, int r, int x)
{
	if(1 <= l && l <= n + 1) for(int i = l; i < N; i += (i&-i)) bit[i] += x;

	if(1 <= r + 1&& r + 1 <= n + 1) for(int i = r + 1; i < N; i += (i&-i)) bit[i] -= x;
}

ll query(int x)
{
	ll aux = 0;

	if(x <= 0 || x > n + 1) return inf;

	for(int i = x; i > 0; i -= (i&-i)) aux += bit[i];

	return aux;
}

int32_t main()
{
	scanf("%d %d %lld %lld", &n, &q, &S, &T);

	for(int i = 1; i <= n + 1; i++) scanf("%lld", &A[i]), upd(i, i, A[i]);

	for(int i = 1; i <= n; i++) ans += (A[i] <= A[i + 1] ? (- A[i + 1] + A[i])*S : (A[i] - A[i + 1])*T);

	for(int i = 1; i <= q; i++)
	{
		int li, ri;

		ll xi;

		scanf("%d %d %lld", &li, &ri, &xi);

		li ++, ri ++;

		ll Hl = query(li);

		ll Hr = query(ri);

		ll H_depois = query(ri + 1);

		ll H_antes = query(li - 1);

		upd(li, ri, xi);

		ll dl = 0, dr = 0;

		if(H_antes != inf && H_antes <= Hl) dl -= abs(Hl - H_antes)*S ;

		else if(H_antes  != inf) dl += abs(Hl - H_antes)*T;

		if(Hr <= H_depois && H_depois != inf) dr -= abs(H_depois - Hr)*S ;

		else if(H_depois != inf) dr += abs(H_depois - Hr)*T;

		ans = ans - dl - dr;

		Hl += xi, Hr += xi;

		dl = 0, dr = 0;

		if(H_antes <= Hl&& H_antes != inf) dl -= abs(Hl - H_antes)*S ;

		else if(H_antes != inf) dl += abs(Hl - H_antes)*T;

		if(Hr <= H_depois && H_depois != inf) dr -= abs(H_depois - Hr)*S ;

		else if(H_depois != inf) dr += abs(H_depois - Hr)*T;

		ans += dl + dr;

		printf("%lld\n", ans);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int32_t main()':
foehn_phenomena.cpp:31:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %lld %lld", &n, &q, &S, &T);
                                          ^
foehn_phenomena.cpp:33:71: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= n + 1; i++) scanf("%lld", &A[i]), upd(i, i, A[i]);
                                                                       ^
foehn_phenomena.cpp:43:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %lld", &li, &ri, &xi);
                                     ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5140 KB Output is correct
2 Correct 0 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 249 ms 5140 KB Output is correct
2 Correct 246 ms 5140 KB Output is correct
3 Correct 219 ms 5140 KB Output is correct
4 Correct 199 ms 5140 KB Output is correct
5 Correct 266 ms 5140 KB Output is correct
6 Correct 189 ms 5140 KB Output is correct
7 Correct 176 ms 5140 KB Output is correct
8 Correct 239 ms 5140 KB Output is correct
9 Correct 209 ms 5140 KB Output is correct
10 Correct 233 ms 5140 KB Output is correct
11 Correct 146 ms 5140 KB Output is correct
12 Correct 189 ms 5140 KB Output is correct
13 Correct 179 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 0 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 249 ms 5140 KB Output is correct
23 Correct 246 ms 5140 KB Output is correct
24 Correct 219 ms 5140 KB Output is correct
25 Correct 199 ms 5140 KB Output is correct
26 Correct 266 ms 5140 KB Output is correct
27 Correct 189 ms 5140 KB Output is correct
28 Correct 176 ms 5140 KB Output is correct
29 Correct 239 ms 5140 KB Output is correct
30 Correct 209 ms 5140 KB Output is correct
31 Correct 233 ms 5140 KB Output is correct
32 Correct 146 ms 5140 KB Output is correct
33 Correct 189 ms 5140 KB Output is correct
34 Correct 179 ms 5140 KB Output is correct
35 Correct 219 ms 5140 KB Output is correct
36 Correct 219 ms 5140 KB Output is correct
37 Correct 233 ms 5140 KB Output is correct
38 Correct 276 ms 5140 KB Output is correct
39 Correct 236 ms 5140 KB Output is correct
40 Correct 219 ms 5140 KB Output is correct
41 Correct 249 ms 5140 KB Output is correct
42 Correct 263 ms 5140 KB Output is correct
43 Correct 253 ms 5140 KB Output is correct
44 Correct 256 ms 5140 KB Output is correct
45 Correct 209 ms 5140 KB Output is correct
46 Correct 229 ms 5140 KB Output is correct
47 Correct 203 ms 5140 KB Output is correct
48 Correct 186 ms 5140 KB Output is correct
49 Correct 193 ms 5140 KB Output is correct
50 Correct 149 ms 5140 KB Output is correct
51 Correct 176 ms 5140 KB Output is correct
52 Correct 203 ms 5140 KB Output is correct