Submission #129297

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
129297	2019-07-12T02:25:46 Z	MrUnknown	Foehn Phenomena (JOI17_foehn_phenomena)	C++11	100 / 100	181 ms	7292 KB

foehn_phenomena

/***
 *      __  __            _    _       _
 *     |  \/  |          | |  | |     | |
 *     | \  / |_ __      | |  | |_ __ | | ___ __   _____      ___ __
 *     | |\/| | '__|     | |  | | '_ \| |/ / '_ \ / _ \ \ /\ / / '_ \
 *     | |  | | |     _  | |__| | | | |   <| | | | (_) \ V  V /| | | |
 *     |_|  |_|_|    (_)  \____/|_| |_|_|\_\_| |_|\___/ \_/\_/ |_| |_|
 *
 *
***/
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for (int i=a;i<=b;i++)
#define f_(i,a,b) for (int i=a;i>=b;i--)
#define MP make_pair
#define ii pair<int,int>
#define iii pair<int,ii>
const ll mod=1000000007;

int n,q;
ll s,t,a[200005],hieu[200005],tong=0;
int main() {
//	freopen("","r",stdin);
//	freopen("","w",stdout);
	scanf("%d %d %lld %lld", &n, &q, &s, &t);
	f(i,0,n) {
		scanf("%lld", &a[i]);
		if (i>0) hieu[i]=a[i]-a[i-1];
		if (hieu[i]>=0) tong-=s*hieu[i];
		else tong-=t*hieu[i];
	}
//	f(i,0,n) cout<<a[i]<<" ";
//	cout<<"\n";
//	cout<<"!"<<tong<<"\n";
//	cout<<"check: ";
//	f(i,1,n) cout<<hieu[i]<<" ";
//	cout<<"\n";
	while (q--) {
		int l,r;
		ll x;
		scanf("%d %d %lld", &l, &r, &x);
		if (l!=0) {
			if (hieu[l]>=0) tong+=s*hieu[l];
			else tong+=t*hieu[l];
		}
		if (r!=n) {
			if (hieu[r+1]>=0) tong+=s*hieu[r+1];
			else tong+=t*hieu[r+1];
		}
//		cout<<"              "<<tong<<" "<<hieu[l]<<" "<<hieu[r+1]<<"\n";
		if (l!=0) hieu[l]+=x;
		if (r!=n) hieu[r+1]-=x;
//		cout<<"check: ";
//		f(i,1,n) cout<<hieu[i]<<" ";
//		cout<<"\n";
//		cout<<"              "<<tong<<" "<<hieu[l]<<" "<<hieu[r+1]<<" ";
		if (l!=0) {
			if (hieu[l]>=0) tong-=s*hieu[l];
			else tong-=t*hieu[l];
		}
		if (r!=n) {
			if (hieu[r+1]>=0) tong-=s*hieu[r+1];
			else tong-=t*hieu[r+1];
		}
		printf("%lld\n", tong);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:27: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:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]);
   ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %lld", &l, &r, &x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 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	3 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	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	4 ms	380 KB	Output is correct
16	Correct	3 ms	376 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	376 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	162 ms	4856 KB	Output is correct
2	Correct	171 ms	5592 KB	Output is correct
3	Correct	167 ms	6140 KB	Output is correct
4	Correct	143 ms	5240 KB	Output is correct
5	Correct	149 ms	6020 KB	Output is correct
6	Correct	129 ms	6392 KB	Output is correct
7	Correct	131 ms	6520 KB	Output is correct
8	Correct	168 ms	6392 KB	Output is correct
9	Correct	164 ms	6648 KB	Output is correct
10	Correct	163 ms	5368 KB	Output is correct
11	Correct	113 ms	6520 KB	Output is correct
12	Correct	123 ms	6876 KB	Output is correct
13	Correct	123 ms	7160 KB	Output is correct

Subtask #3

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 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	3 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	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	4 ms	380 KB	Output is correct
16	Correct	3 ms	376 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	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	162 ms	4856 KB	Output is correct
23	Correct	171 ms	5592 KB	Output is correct
24	Correct	167 ms	6140 KB	Output is correct
25	Correct	143 ms	5240 KB	Output is correct
26	Correct	149 ms	6020 KB	Output is correct
27	Correct	129 ms	6392 KB	Output is correct
28	Correct	131 ms	6520 KB	Output is correct
29	Correct	168 ms	6392 KB	Output is correct
30	Correct	164 ms	6648 KB	Output is correct
31	Correct	163 ms	5368 KB	Output is correct
32	Correct	113 ms	6520 KB	Output is correct
33	Correct	123 ms	6876 KB	Output is correct
34	Correct	123 ms	7160 KB	Output is correct
35	Correct	170 ms	5092 KB	Output is correct
36	Correct	173 ms	6520 KB	Output is correct
37	Correct	169 ms	7288 KB	Output is correct
38	Correct	176 ms	7160 KB	Output is correct
39	Correct	181 ms	7032 KB	Output is correct
40	Correct	177 ms	7096 KB	Output is correct
41	Correct	174 ms	6904 KB	Output is correct
42	Correct	169 ms	6904 KB	Output is correct
43	Correct	166 ms	6364 KB	Output is correct
44	Correct	168 ms	6648 KB	Output is correct
45	Correct	151 ms	6548 KB	Output is correct
46	Correct	160 ms	7292 KB	Output is correct
47	Correct	131 ms	7032 KB	Output is correct
48	Correct	138 ms	7288 KB	Output is correct
49	Correct	143 ms	6264 KB	Output is correct
50	Correct	115 ms	7160 KB	Output is correct
51	Correct	124 ms	7032 KB	Output is correct
52	Correct	124 ms	7064 KB	Output is correct