oj.uz

Submission #38041

# Submission time Handle Problem Language Result Execution time Memory
38041 2017-12-31T00:41:12 Z MatheusLealV Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 279 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;
}

int 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, xi;

		cin>>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 'int 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]);
                                                                       ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5140 KB Output is correct
2 Correct 3 ms 5140 KB Output is correct
3 Correct 23 ms 5140 KB Output is correct
4 Correct 6 ms 5140 KB Output is correct
5 Correct 9 ms 5140 KB Output is correct
6 Correct 16 ms 5140 KB Output is correct
7 Correct 9 ms 5140 KB Output is correct
8 Correct 6 ms 5140 KB Output is correct
9 Correct 9 ms 5140 KB Output is correct
10 Correct 6 ms 5140 KB Output is correct
11 Correct 6 ms 5140 KB Output is correct
12 Correct 3 ms 5140 KB Output is correct
13 Correct 16 ms 5140 KB Output is correct
14 Correct 6 ms 5140 KB Output is correct
15 Correct 16 ms 5140 KB Output is correct
16 Correct 6 ms 5140 KB Output is correct
17 Correct 6 ms 5140 KB Output is correct
18 Correct 16 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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 279 ms 5140 KB Execution timed out (wall clock limit exceeded)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5140 KB Output is correct
2 Correct 3 ms 5140 KB Output is correct
3 Correct 23 ms 5140 KB Output is correct
4 Correct 6 ms 5140 KB Output is correct
5 Correct 9 ms 5140 KB Output is correct
6 Correct 16 ms 5140 KB Output is correct
7 Correct 9 ms 5140 KB Output is correct
8 Correct 6 ms 5140 KB Output is correct
9 Correct 9 ms 5140 KB Output is correct
10 Correct 6 ms 5140 KB Output is correct
11 Correct 6 ms 5140 KB Output is correct
12 Correct 3 ms 5140 KB Output is correct
13 Correct 16 ms 5140 KB Output is correct
14 Correct 6 ms 5140 KB Output is correct
15 Correct 16 ms 5140 KB Output is correct
16 Correct 6 ms 5140 KB Output is correct
17 Correct 6 ms 5140 KB Output is correct
18 Correct 16 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 Runtime error 279 ms 5140 KB Execution timed out (wall clock limit exceeded)
23 Halted 0 ms 0 KB -