oj.uz

Submission #497641

# Submission time Handle Problem Language Result Execution time Memory
497641 2021-12-23T12:36:04 Z penguin133 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 133 ms 13044 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int ft[200005],n,q,s,t;
void update(int l, int r, int v){
	r++;
	for(;l<=n;l+=(l & -l))ft[l] += v;
	for(;r<=n;r+=(r & -r))ft[r] -= v;
}
int query(int p){
	int sum = 0;
	for(;p;p-=(p & -p))sum += ft[p];
	return sum;
}
int A[200005];
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int h,w,ans = 0;
	cin >> n >> q >> s >> t; 
	for(int i=0;i<=n;i++){
		cin >> A[i];
		if(i == 0)continue;
		if(A[i] > A[i-1])ans -= s * abs(A[i] - A[i-1]);
		else ans += t * abs(A[i] - A[i-1]);
		update(i,i,A[i]);
	}
	while(q--){
		int l,r,v;
		cin >> l>> r >> v;
		int x = query(l) - query(l-1);
		int y = 0;
		if(r < n)y = query(r+1) - query(r);
		update(l,r,v);
		int x1 = query(l) - query(l-1);
		if(x <= 0)ans -= t*(-x);
		else ans += x*s;
		if(x1 <= 0)ans -= t*x1;
		else ans -= x1*s;
		if(r != n){
			int y1 = query(r+1) - query(r);
			if(y <= 0)ans -= t*(-y);
			else ans += s*y;
			if(y1 <= 0)ans += t*(-y1);
			else ans -= s*y1;
		}
		cout << ans << '\n';
	}
}

Compilation message

foehn_phenomena.cpp:16:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   16 | main(){
      | ^~~~
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:18:6: warning: unused variable 'h' [-Wunused-variable]
   18 |  int h,w,ans = 0;
      |      ^
foehn_phenomena.cpp:18:8: warning: unused variable 'w' [-Wunused-variable]
   18 |  int h,w,ans = 0;
      |        ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 10272 KB Output is correct
2 Correct 130 ms 10888 KB Output is correct
3 Correct 133 ms 11472 KB Output is correct
4 Correct 129 ms 10772 KB Output is correct
5 Correct 129 ms 12032 KB Output is correct
6 Correct 88 ms 10948 KB Output is correct
7 Correct 91 ms 10980 KB Output is correct
8 Correct 114 ms 11808 KB Output is correct
9 Correct 119 ms 12164 KB Output is correct
10 Correct 114 ms 10832 KB Output is correct
11 Correct 91 ms 10888 KB Output is correct
12 Correct 89 ms 11572 KB Output is correct
13 Correct 86 ms 11872 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 324 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 324 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 126 ms 10272 KB Output is correct
23 Correct 130 ms 10888 KB Output is correct
24 Correct 133 ms 11472 KB Output is correct
25 Correct 129 ms 10772 KB Output is correct
26 Correct 129 ms 12032 KB Output is correct
27 Correct 88 ms 10948 KB Output is correct
28 Correct 91 ms 10980 KB Output is correct
29 Correct 114 ms 11808 KB Output is correct
30 Correct 119 ms 12164 KB Output is correct
31 Correct 114 ms 10832 KB Output is correct
32 Correct 91 ms 10888 KB Output is correct
33 Correct 89 ms 11572 KB Output is correct
34 Correct 86 ms 11872 KB Output is correct
35 Correct 128 ms 10312 KB Output is correct
36 Correct 129 ms 11844 KB Output is correct
37 Correct 129 ms 12584 KB Output is correct
38 Correct 131 ms 12356 KB Output is correct
39 Correct 125 ms 12452 KB Output is correct
40 Correct 132 ms 12396 KB Output is correct
41 Correct 126 ms 12264 KB Output is correct
42 Correct 126 ms 12356 KB Output is correct
43 Correct 124 ms 11572 KB Output is correct
44 Correct 127 ms 12008 KB Output is correct
45 Correct 122 ms 11972 KB Output is correct
46 Correct 126 ms 13044 KB Output is correct
47 Correct 94 ms 11704 KB Output is correct
48 Correct 99 ms 11588 KB Output is correct
49 Correct 112 ms 10684 KB Output is correct
50 Correct 91 ms 11528 KB Output is correct
51 Correct 87 ms 11888 KB Output is correct
52 Correct 89 ms 11652 KB Output is correct