oj.uz

Submission #315947

# Submission time Handle Problem Language Result Execution time Memory
315947 2020-10-24T13:32:46 Z jjj Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 173 ms 13176 KB 
#include <bits/stdc++.h>

using namespace std;

long long a[200010], b[200010];

int main()
{
	int n, q;
	long long s, t, v = 0;
	
	scanf("%d%d%lld%lld", &n, &q, &s, &t);
	
	for(int i = 0; i <= n; i++) scanf("%lld", &a[i]);
	
	for(int i = 1; i <= n; i++)
		b[i] = a[i] - a[i - 1];
		
	for(int i = 1; i <= n; i++)
	{
		if(b[i] > 0) v -= s * b[i];
		else v -= t * b[i];
	}
	
	while(q--)
	{
		int l, r;
		long long x;
		
		scanf("%d%d%lld", &l, &r, &x);
				
		if(b[l] > 0) v += s * b[l];
		else v += t * b[l];
		
		b[l] += x;
		
		if(b[l] > 0) v -= s * b[l];
		else v -= t * b[l];
		
		if(r != n)
		{
			if(b[r + 1] > 0) v += s * b[r + 1];
			else v += t * b[r + 1];
		
			b[r + 1] -= x;
		
			if(b[r + 1] > 0) v -= s * b[r + 1];
			else v -= t * b[r + 1];
		}
		
		printf("%lld\n", v);
	}
	
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |  scanf("%d%d%lld%lld", &n, &q, &s, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:14:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |  for(int i = 0; i <= n; i++) scanf("%lld", &a[i]);
      |                              ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |   scanf("%d%d%lld", &l, &r, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 5240 KB Output is correct
2 Correct 158 ms 5996 KB Output is correct
3 Correct 173 ms 6520 KB Output is correct
4 Correct 142 ms 5596 KB Output is correct
5 Correct 153 ms 12028 KB Output is correct
6 Correct 134 ms 11088 KB Output is correct
7 Correct 136 ms 11000 KB Output is correct
8 Correct 167 ms 11812 KB Output is correct
9 Correct 160 ms 12368 KB Output is correct
10 Correct 158 ms 10872 KB Output is correct
11 Correct 119 ms 11000 KB Output is correct
12 Correct 130 ms 11640 KB Output is correct
13 Correct 128 ms 12024 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 165 ms 5240 KB Output is correct
23 Correct 158 ms 5996 KB Output is correct
24 Correct 173 ms 6520 KB Output is correct
25 Correct 142 ms 5596 KB Output is correct
26 Correct 153 ms 12028 KB Output is correct
27 Correct 134 ms 11088 KB Output is correct
28 Correct 136 ms 11000 KB Output is correct
29 Correct 167 ms 11812 KB Output is correct
30 Correct 160 ms 12368 KB Output is correct
31 Correct 158 ms 10872 KB Output is correct
32 Correct 119 ms 11000 KB Output is correct
33 Correct 130 ms 11640 KB Output is correct
34 Correct 128 ms 12024 KB Output is correct
35 Correct 163 ms 10488 KB Output is correct
36 Correct 167 ms 11888 KB Output is correct
37 Correct 168 ms 12792 KB Output is correct
38 Correct 173 ms 12408 KB Output is correct
39 Correct 171 ms 12536 KB Output is correct
40 Correct 168 ms 12536 KB Output is correct
41 Correct 172 ms 12280 KB Output is correct
42 Correct 167 ms 12440 KB Output is correct
43 Correct 160 ms 11640 KB Output is correct
44 Correct 165 ms 12024 KB Output is correct
45 Correct 144 ms 12152 KB Output is correct
46 Correct 155 ms 13176 KB Output is correct
47 Correct 137 ms 11640 KB Output is correct
48 Correct 136 ms 11768 KB Output is correct
49 Correct 144 ms 10744 KB Output is correct
50 Correct 119 ms 11512 KB Output is correct
51 Correct 130 ms 12024 KB Output is correct
52 Correct 128 ms 11640 KB Output is correct