oj.uz

Submission #33264

# Submission time Handle Problem Language Result Execution time Memory
33264 2017-10-23T07:38:57 Z YoLo Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 253 ms 17640 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define endl '\n'
#define pi acos(-1)
#define pque priority_queue
#define N 1000000
#define lmax LONG_LONG_MAX
typedef pair < int, int > ii;
typedef vector < int > vi;
typedef vector < vi > vii;
int mod = 1000000007;
int n, q, s, t, a[1000009], f[1000009], ans, l, r, x;
signed main()
{
	//ios_base::sync_with_stdio(0);
	scanf("%lld %lld %lld %lld", &n, &q, &s, &t);
	for(int i = 0; i <= n; i++)
		scanf("%lld", &a[i]);
	for(int i = 1; i <= n; i++)
	{
		f[i] = a[i] - a[i - 1];
		if(f[i] > 0)
			ans -= f[i] * s;
		else
			ans -= f[i] * t;
	}
	while(q--)
	{
		scanf("%lld %lld %lld", &l, &r, &x);
		if(f[l] > 0)
			ans += f[l] * s;
		else
			ans += f[l] * t;
		if(r < n)
		{
			if(f[r + 1] > 0)
				ans += f[r + 1] * s;
			else
				ans += f[r + 1] * t;
		}
		f[l] += x;
		f[r + 1] -= x;
		if(f[l] > 0)
			ans -= f[l] * s;
		else
			ans -= f[l] * t;
		if(r < n)
		{
			if(f[r + 1] > 0)
				ans -= f[r + 1] * s;
			else
				ans -= f[r + 1] * t;
		}
		printf("%lld\n", ans);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:21:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld %lld", &n, &q, &s, &t);
                                              ^
foehn_phenomena.cpp:23:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]);
                       ^
foehn_phenomena.cpp:34:38: 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 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 0 ms 17640 KB Output is correct
5 Correct 0 ms 17640 KB Output is correct
6 Correct 0 ms 17640 KB Output is correct
7 Correct 0 ms 17640 KB Output is correct
8 Correct 0 ms 17640 KB Output is correct
9 Correct 0 ms 17640 KB Output is correct
10 Correct 0 ms 17640 KB Output is correct
11 Correct 0 ms 17640 KB Output is correct
12 Correct 0 ms 17640 KB Output is correct
13 Correct 0 ms 17640 KB Output is correct
14 Correct 0 ms 17640 KB Output is correct
15 Correct 0 ms 17640 KB Output is correct
16 Correct 0 ms 17640 KB Output is correct
17 Correct 0 ms 17640 KB Output is correct
18 Correct 0 ms 17640 KB Output is correct
19 Correct 0 ms 17640 KB Output is correct
20 Correct 0 ms 17640 KB Output is correct
21 Correct 0 ms 17640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 17640 KB Output is correct
2 Correct 186 ms 17640 KB Output is correct
3 Correct 186 ms 17640 KB Output is correct
4 Correct 156 ms 17640 KB Output is correct
5 Correct 196 ms 17640 KB Output is correct
6 Correct 166 ms 17640 KB Output is correct
7 Correct 153 ms 17640 KB Output is correct
8 Correct 183 ms 17640 KB Output is correct
9 Correct 189 ms 17640 KB Output is correct
10 Correct 209 ms 17640 KB Output is correct
11 Correct 113 ms 17640 KB Output is correct
12 Correct 133 ms 17640 KB Output is correct
13 Correct 119 ms 17640 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 0 ms 17640 KB Output is correct
5 Correct 0 ms 17640 KB Output is correct
6 Correct 0 ms 17640 KB Output is correct
7 Correct 0 ms 17640 KB Output is correct
8 Correct 0 ms 17640 KB Output is correct
9 Correct 0 ms 17640 KB Output is correct
10 Correct 0 ms 17640 KB Output is correct
11 Correct 0 ms 17640 KB Output is correct
12 Correct 0 ms 17640 KB Output is correct
13 Correct 0 ms 17640 KB Output is correct
14 Correct 0 ms 17640 KB Output is correct
15 Correct 0 ms 17640 KB Output is correct
16 Correct 0 ms 17640 KB Output is correct
17 Correct 0 ms 17640 KB Output is correct
18 Correct 0 ms 17640 KB Output is correct
19 Correct 0 ms 17640 KB Output is correct
20 Correct 0 ms 17640 KB Output is correct
21 Correct 0 ms 17640 KB Output is correct
22 Correct 149 ms 17640 KB Output is correct
23 Correct 186 ms 17640 KB Output is correct
24 Correct 186 ms 17640 KB Output is correct
25 Correct 156 ms 17640 KB Output is correct
26 Correct 196 ms 17640 KB Output is correct
27 Correct 166 ms 17640 KB Output is correct
28 Correct 153 ms 17640 KB Output is correct
29 Correct 183 ms 17640 KB Output is correct
30 Correct 189 ms 17640 KB Output is correct
31 Correct 209 ms 17640 KB Output is correct
32 Correct 113 ms 17640 KB Output is correct
33 Correct 133 ms 17640 KB Output is correct
34 Correct 119 ms 17640 KB Output is correct
35 Correct 176 ms 17640 KB Output is correct
36 Correct 216 ms 17640 KB Output is correct
37 Correct 153 ms 17640 KB Output is correct
38 Correct 253 ms 17640 KB Output is correct
39 Correct 206 ms 17640 KB Output is correct
40 Correct 226 ms 17640 KB Output is correct
41 Correct 216 ms 17640 KB Output is correct
42 Correct 229 ms 17640 KB Output is correct
43 Correct 219 ms 17640 KB Output is correct
44 Correct 159 ms 17640 KB Output is correct
45 Correct 159 ms 17640 KB Output is correct
46 Correct 189 ms 17640 KB Output is correct
47 Correct 146 ms 17640 KB Output is correct
48 Correct 139 ms 17640 KB Output is correct
49 Correct 183 ms 17640 KB Output is correct
50 Correct 103 ms 17640 KB Output is correct
51 Correct 139 ms 17640 KB Output is correct
52 Correct 139 ms 17640 KB Output is correct