oj.uz

Submission #142624

# Submission time Handle Problem Language Result Execution time Memory
142624 2019-08-10T05:33:55 Z arnold518 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 190 ms 11568 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

int N, Q;
ll S, T, A[MAXN+10], U, D;

int main()
{
	int i, j;
	
	scanf("%d%d%lld%lld", &N, &Q, &S, &T);
	for(i=0; i<=N; i++) scanf("%lld", &A[i]);
	for(i=N; i>=1; i--) A[i]-=A[i-1];
	for(i=1; i<=N; i++)
	{
		if(0<A[i]) U+=A[i];
		else D+=A[i];
	}

	while(Q--)
	{
		ll L, R, X;
		scanf("%lld%lld%lld", &L, &R, &X);

		if(0<A[L]) U-=A[L];
		else D-=A[L];
		if(R!=N)
		{
			if(0<A[R+1]) U-=A[R+1];
			else D-=A[R+1];
		}

		A[L]+=X; A[R+1]-=X;

		if(0<A[L]) U+=A[L];
		else D+=A[L];
		if(R!=N)
		{
			if(0<A[R+1]) U+=A[R+1];
			else D+=A[R+1];
		}
		
		//for(i=1; i<=N; i++) printf("%lld ", A[i]); printf("\n");
		//printf("%lld %lld / %lld\n", U, D, -(U*S+D*T));
		printf("%lld\n", -U*S-D*T);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:15:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
foehn_phenomena.cpp:17:7: 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:18:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=0; i<=N; i++) scanf("%lld", &A[i]);
                      ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &L, &R, &X);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 8688 KB Output is correct
2 Correct 159 ms 9328 KB Output is correct
3 Correct 159 ms 9888 KB Output is correct
4 Correct 149 ms 9308 KB Output is correct
5 Correct 147 ms 10540 KB Output is correct
6 Correct 127 ms 9464 KB Output is correct
7 Correct 127 ms 9464 KB Output is correct
8 Correct 190 ms 10332 KB Output is correct
9 Correct 179 ms 10616 KB Output is correct
10 Correct 162 ms 9380 KB Output is correct
11 Correct 111 ms 9336 KB Output is correct
12 Correct 121 ms 10108 KB Output is correct
13 Correct 120 ms 10492 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 424 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 158 ms 8688 KB Output is correct
23 Correct 159 ms 9328 KB Output is correct
24 Correct 159 ms 9888 KB Output is correct
25 Correct 149 ms 9308 KB Output is correct
26 Correct 147 ms 10540 KB Output is correct
27 Correct 127 ms 9464 KB Output is correct
28 Correct 127 ms 9464 KB Output is correct
29 Correct 190 ms 10332 KB Output is correct
30 Correct 179 ms 10616 KB Output is correct
31 Correct 162 ms 9380 KB Output is correct
32 Correct 111 ms 9336 KB Output is correct
33 Correct 121 ms 10108 KB Output is correct
34 Correct 120 ms 10492 KB Output is correct
35 Correct 159 ms 8856 KB Output is correct
36 Correct 162 ms 10232 KB Output is correct
37 Correct 169 ms 11116 KB Output is correct
38 Correct 165 ms 11036 KB Output is correct
39 Correct 167 ms 10872 KB Output is correct
40 Correct 166 ms 11032 KB Output is correct
41 Correct 165 ms 10744 KB Output is correct
42 Correct 166 ms 10908 KB Output is correct
43 Correct 166 ms 10104 KB Output is correct
44 Correct 162 ms 10528 KB Output is correct
45 Correct 148 ms 10488 KB Output is correct
46 Correct 162 ms 11568 KB Output is correct
47 Correct 128 ms 10108 KB Output is correct
48 Correct 130 ms 10112 KB Output is correct
49 Correct 141 ms 9084 KB Output is correct
50 Correct 113 ms 9976 KB Output is correct
51 Correct 121 ms 10460 KB Output is correct
52 Correct 121 ms 10104 KB Output is correct