Submission #33273

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
33273	2017-10-23T08:02:05 Z	huynd2001	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	30 / 100	216 ms	5140 KB

foehn_phenomena

/*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];

signed main()
{
	int n,q,s,t;
	cin >> n >> q >> s >> t;
	for(int i=0;i<=n;i++)
	{
		cin >> 	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++)
	{
		int l,r,x;
		cin >> l >> r >> x;
		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;
	}
	return 0;
}

Subtask #1

30.0 / 30.0

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

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	216 ms	5140 KB	Execution timed out (wall clock limit exceeded)
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	5140 KB	Output is correct
2	Correct	3 ms	5140 KB	Output is correct
3	Correct	6 ms	5140 KB	Output is correct
4	Correct	0 ms	5140 KB	Output is correct
5	Correct	3 ms	5140 KB	Output is correct
6	Correct	3 ms	5140 KB	Output is correct
7	Correct	9 ms	5140 KB	Output is correct
8	Correct	9 ms	5140 KB	Output is correct
9	Correct	9 ms	5140 KB	Output is correct
10	Correct	3 ms	5140 KB	Output is correct
11	Correct	3 ms	5140 KB	Output is correct
12	Correct	6 ms	5140 KB	Output is correct
13	Correct	6 ms	5140 KB	Output is correct
14	Correct	6 ms	5140 KB	Output is correct
15	Correct	9 ms	5140 KB	Output is correct
16	Correct	13 ms	5140 KB	Output is correct
17	Correct	16 ms	5140 KB	Output is correct
18	Correct	0 ms	5140 KB	Output is correct
19	Correct	0 ms	5140 KB	Output is correct
20	Correct	0 ms	5140 KB	Output is correct
21	Correct	0 ms	5140 KB	Output is correct
22	Runtime error	216 ms	5140 KB	Execution timed out (wall clock limit exceeded)
23	Halted	0 ms	0 KB	-