oj.uz

Submission #33277

# Submission time Handle Problem Language Result Execution time Memory
33277 2017-10-23T08:09:36 Z huynd2001 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 196 ms 9828 KB 
/*huypheu
7 8 8 13
0
4
-9
4
-2
3
10
-9
1 4 8
3 5 -2
3 3 9
1 7 4
3 5 -1
5 6 3
4 4 9
6 7 -10
*/
// https://oj.uz/problem/view/JOI17_foehn_phenomena
#include <bits/stdc++.h>
#define int long long
using namespace std;

int a[200007],h[200007];
int la[200007],ra[200007],xa[200007];

signed main()
{
	// ios_base::sync_with_stdio(false);
	// cin.tie(0);
	int n,q,s,t;
	// cin >> n >> q >> s >> t;
	// printf("lz");
	scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
	for(int i=0;i<=n;i++)
	{
		// cin >> 	h[i];
		scanf("%lld",&h[i]);
		if(i>=1) a[i]=h[i]-h[i-1];
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]>0) ans-=a[i]*s; else ans-=a[i]*t;
	}
	for(int i=1;i<=q;i++)
	{
		// cin >> la[i] >> ra[i] >> xa[i];
		scanf("%lld %lld %lld",&la[i],&ra[i],&xa[i]);
	}
	// printf("lz");
	for(int i=1;i<=q;i++)
	{
		int l,r,x;
		l=la[i],r=ra[i],x=xa[i];
		if(l!=0)
		{
			if(r!=n)
			{
				if(a[l]>0) ans+=a[l]*s; else ans+=a[l]*t;
				if(a[r+1]>0) ans+=a[r+1]*s; else ans+=a[r+1]*t;
				a[l]+=x;
				a[r+1]-=x;
				if(a[l]>0) ans-=a[l]*s; else ans-=a[l]*t;
				if(a[r+1]>0) ans-=a[r+1]*s; else ans-=a[r+1]*t;
			}
			else
			{
				if(a[l]>0) ans+=a[l]*s; else ans+=a[l]*t;
				a[l]+=x;
				if(a[l]>0) ans-=a[l]*s; else ans-=a[l]*t;
			}
		}
		else
		{
			if(r!=n)
			{
				if(a[r+1]>0) ans+=a[r+1]*s; else ans+=a[r+1]*t;
				a[r+1]-=x;
				if(a[r+1]>0) ans-=a[r+1]*s; else ans-=a[r+1]*t;
			}
			else
			{

			}
		}
		// cout << ans << endl;
		printf("%lld\n",ans);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:35:42: 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:39:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&h[i]);
                      ^
foehn_phenomena.cpp:50:47: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld",&la[i],&ra[i],&xa[i]);
                                               ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 9828 KB Output is correct
2 Correct 136 ms 9828 KB Output is correct
3 Correct 146 ms 9828 KB Output is correct
4 Correct 133 ms 9828 KB Output is correct
5 Correct 129 ms 9828 KB Output is correct
6 Correct 123 ms 9828 KB Output is correct
7 Correct 113 ms 9828 KB Output is correct
8 Correct 149 ms 9828 KB Output is correct
9 Correct 169 ms 9828 KB Output is correct
10 Correct 169 ms 9828 KB Output is correct
11 Correct 113 ms 9828 KB Output is correct
12 Correct 143 ms 9828 KB Output is correct
13 Correct 133 ms 9828 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9828 KB Output is correct
2 Correct 0 ms 9828 KB Output is correct
3 Correct 0 ms 9828 KB Output is correct
4 Correct 0 ms 9828 KB Output is correct
5 Correct 0 ms 9828 KB Output is correct
6 Correct 0 ms 9828 KB Output is correct
7 Correct 0 ms 9828 KB Output is correct
8 Correct 0 ms 9828 KB Output is correct
9 Correct 0 ms 9828 KB Output is correct
10 Correct 0 ms 9828 KB Output is correct
11 Correct 0 ms 9828 KB Output is correct
12 Correct 0 ms 9828 KB Output is correct
13 Correct 0 ms 9828 KB Output is correct
14 Correct 0 ms 9828 KB Output is correct
15 Correct 0 ms 9828 KB Output is correct
16 Correct 0 ms 9828 KB Output is correct
17 Correct 0 ms 9828 KB Output is correct
18 Correct 0 ms 9828 KB Output is correct
19 Correct 0 ms 9828 KB Output is correct
20 Correct 0 ms 9828 KB Output is correct
21 Correct 0 ms 9828 KB Output is correct
22 Correct 159 ms 9828 KB Output is correct
23 Correct 136 ms 9828 KB Output is correct
24 Correct 146 ms 9828 KB Output is correct
25 Correct 133 ms 9828 KB Output is correct
26 Correct 129 ms 9828 KB Output is correct
27 Correct 123 ms 9828 KB Output is correct
28 Correct 113 ms 9828 KB Output is correct
29 Correct 149 ms 9828 KB Output is correct
30 Correct 169 ms 9828 KB Output is correct
31 Correct 169 ms 9828 KB Output is correct
32 Correct 113 ms 9828 KB Output is correct
33 Correct 143 ms 9828 KB Output is correct
34 Correct 133 ms 9828 KB Output is correct
35 Correct 189 ms 9828 KB Output is correct
36 Correct 166 ms 9828 KB Output is correct
37 Correct 156 ms 9828 KB Output is correct
38 Correct 166 ms 9828 KB Output is correct
39 Correct 169 ms 9828 KB Output is correct
40 Correct 166 ms 9828 KB Output is correct
41 Correct 153 ms 9828 KB Output is correct
42 Correct 196 ms 9828 KB Output is correct
43 Correct 176 ms 9828 KB Output is correct
44 Correct 169 ms 9828 KB Output is correct
45 Correct 149 ms 9828 KB Output is correct
46 Correct 149 ms 9828 KB Output is correct
47 Correct 133 ms 9828 KB Output is correct
48 Correct 133 ms 9828 KB Output is correct
49 Correct 126 ms 9828 KB Output is correct
50 Correct 86 ms 9828 KB Output is correct
51 Correct 119 ms 9828 KB Output is correct
52 Correct 119 ms 9828 KB Output is correct