oj.uz

Submission #364238

# Submission time Handle Problem Language Result Execution time Memory
364238 2021-02-08T13:43:36 Z Rainbowbunny Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 195 ms 13164 KB 
#include <iostream>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>

int n, q;
long long S, T;
long long BIT[200005], A[200005];

void Add(int node, long long val)
{
	for(node; node <= n + 1; node += node & -node)
	{
		BIT[node] += val;
	}
}

long long Get(int node)
{
	long long ans = 0;
	for(node; node > 0; node -= node & -node)
	{
		ans += BIT[node];
	}
	return ans;
}

int main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	std::cin >> n >> q >> S >> T; 
	for(int i = 1; i <= n + 1; i++)
	{
		std::cin >> A[i];
		Add(i, A[i]);
		Add(i + 1, -A[i]);
	}
	long long ans = 0;
	for(int i = 1; i <= n; i++)
	{
		long long tmp = A[i + 1] - A[i];
		if(tmp > 0)
		{
			ans -= tmp * S;
		}
		else
		{
			ans -= tmp * T;
		}
	}
	while(q--)
	{
		int l, r;
		long long x;
		std::cin >> l >> r >> x;
		l++; r++;
		long long value = Get(l) - Get(l - 1);
		if(value > 0)
		{
			ans += value * S;
		}
		else
		{
			ans += value * T;
		}
		value += x;
		if(value > 0)
		{
			ans -= value * S;
		}
		else
		{
			ans -= value * T;
		}
		if(r != n + 1)
		{
			value = Get(r + 1) - Get(r);
			if(value > 0)
			{
				ans += value * S;
			}
			else
			{
				ans += value * T;
			}
			value -= x;
			if(value > 0)
			{
				ans -= value * S;
			}
			else
			{
				ans -= value * T;
			}
		}
		Add(l, x);
		Add(r + 1, -x);
		std::cout << ans << '\n';
	}
}

Compilation message

foehn_phenomena.cpp: In function 'void Add(int, long long int)':
foehn_phenomena.cpp:13:6: warning: statement has no effect [-Wunused-value]
   13 |  for(node; node <= n + 1; node += node & -node)
      |      ^~~~
foehn_phenomena.cpp: In function 'long long int Get(int)':
foehn_phenomena.cpp:22:6: warning: statement has no effect [-Wunused-value]
   22 |  for(node; node > 0; node -= node & -node)
      |      ^~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 10368 KB Output is correct
2 Correct 148 ms 10988 KB Output is correct
3 Correct 159 ms 11644 KB Output is correct
4 Correct 149 ms 11116 KB Output is correct
5 Correct 154 ms 12140 KB Output is correct
6 Correct 154 ms 11116 KB Output is correct
7 Correct 122 ms 11116 KB Output is correct
8 Correct 159 ms 11888 KB Output is correct
9 Correct 161 ms 12268 KB Output is correct
10 Correct 142 ms 10988 KB Output is correct
11 Correct 124 ms 11016 KB Output is correct
12 Correct 134 ms 11756 KB Output is correct
13 Correct 119 ms 11960 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 152 ms 10368 KB Output is correct
23 Correct 148 ms 10988 KB Output is correct
24 Correct 159 ms 11644 KB Output is correct
25 Correct 149 ms 11116 KB Output is correct
26 Correct 154 ms 12140 KB Output is correct
27 Correct 154 ms 11116 KB Output is correct
28 Correct 122 ms 11116 KB Output is correct
29 Correct 159 ms 11888 KB Output is correct
30 Correct 161 ms 12268 KB Output is correct
31 Correct 142 ms 10988 KB Output is correct
32 Correct 124 ms 11016 KB Output is correct
33 Correct 134 ms 11756 KB Output is correct
34 Correct 119 ms 11960 KB Output is correct
35 Correct 195 ms 10604 KB Output is correct
36 Correct 154 ms 12012 KB Output is correct
37 Correct 164 ms 12760 KB Output is correct
38 Correct 166 ms 12524 KB Output is correct
39 Correct 154 ms 12524 KB Output is correct
40 Correct 160 ms 12524 KB Output is correct
41 Correct 157 ms 12396 KB Output is correct
42 Correct 168 ms 12524 KB Output is correct
43 Correct 159 ms 11884 KB Output is correct
44 Correct 154 ms 12140 KB Output is correct
45 Correct 147 ms 12140 KB Output is correct
46 Correct 157 ms 13164 KB Output is correct
47 Correct 125 ms 11724 KB Output is correct
48 Correct 135 ms 11756 KB Output is correct
49 Correct 146 ms 10860 KB Output is correct
50 Correct 132 ms 11500 KB Output is correct
51 Correct 128 ms 12012 KB Output is correct
52 Correct 124 ms 11764 KB Output is correct