oj.uz

답안 #812737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
812737 2023-08-07T10:35:21 Z Acanikolic Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 138 ms 13132 KB 
#include <bits/stdc++.h>
		 
#define ll long long 
		
#define int long long 
		 
#define pb push_back 
		
#define F first
		 
#define S second
		 
using namespace std;
		 
const long long N = 3e5+10;
		 
const long long mod = 1e9+7;
		 
const long long inf = 1e18;
		
struct fenwick {
	vector<int>fenw;
	void build(int n) {
		fenw.resize(n+1);
	}
	void update(int index,int n,int val) {
		while(index <= n) {
			fenw[index] += val;
			index += index & -index;
		}
	}
	int get(int x) {
		int ret = 0;
		while(x >= 1) {
			ret += fenw[x];
			x -= x & -x;
		}
		return ret;
	}
};		
				
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	
	int n,Q,s,t,smT=0,smS=0;
	cin >> n >> Q >> s >> t;
	vector<int>a(n+1);
	fenwick ft;
	ft.build(n);
	for(int i=0;i<=n;i++) {
		cin >> a[i];
		if(i > 0) {
			ft.update(i,n,a[i]);
			ft.update(i+1,n,-a[i]);
			if(a[i-1] < a[i]) smS += a[i-1]-a[i];
			else smT += a[i-1]-a[i];
		}
	}
	/*while(Q--) {
		int l,r,x;
		cin >> l >> r >> x;
		for(int i=l;i<=r;i++) a[i] += x;
		int res = 0;
		for(int i=1;i<=n;i++) {
			if(a[i-1] < a[i]) res += (a[i-1]-a[i])*s;
			else res += (a[i-1]-a[i])*t;
		}
		cout << res << '\n';
	}*/
	//cout << smS << ' ' << smT << endl;
	while(Q--) {
		int l,r,x;
		cin >> l >> r >> x;
		int raz = ft.get(l-1)-ft.get(l);
		int raz2=0,raz2_posle=0;
		if(r+1 <= n) raz2 = ft.get(r)-ft.get(r+1);
		ft.update(l,n,x);
		ft.update(r+1,n,-x);
		int raz_posle = ft.get(l-1)-ft.get(l);
		if(raz >= 0 && raz_posle >= 0) {
		//	cout << "prvi1" << endl;
			smT -= raz;
			smT += raz_posle;
		}
		if(raz < 0 && raz_posle < 0) {
		//	cout << "drugi1" << endl;
			smS -= raz;
			smS += raz_posle;
		}
		if(raz >= 0 && raz_posle < 0) {
		//	cout << "treci1" << endl;
			smT -= raz;
			smS += raz_posle;
		}
		if(raz < 0 && raz_posle >= 0) {
		//	cout << "cetvrti1" << endl;
			smS -= raz;
			smT += raz_posle;
		}
		if(r+1 <= n) raz2_posle = ft.get(r)-ft.get(r+1);
		if(raz2 >= 0 && raz2_posle >= 0 && r+1 <= n) {
		//	cout << "prvi2" << endl;
			smT -= raz2;
			smT += raz2_posle;
		}
		if(raz2 < 0 && raz2_posle < 0 && r+1 <= n) {
		////	cout << "drugi2" << endl;
			smS -= raz2;
			smS += raz2_posle;
		}
		if(raz2 >= 0 && raz2_posle < 0 && r+1 <= n) {
		//	cout << "drugi3" << endl;
			smT -= raz2;
			smS += raz2_posle;
		}
		if(raz2 < 0 && raz2_posle >= 0 && r+1 <= n) {
		///	cout << "drugi4" << endl;
			smS -= raz2;
			smT += raz2_posle;
		}
		cout << smS*s+smT*t << '\n';
		//cout << "dbg" << endl;
		//for(int i=1;i<=n;i++) cout << ft.get(i) << ' ';
		//cout << endl;
	}
    return 0; 
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 396 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 412 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 10312 KB Output is correct
2 Correct 106 ms 10868 KB Output is correct
3 Correct 106 ms 11436 KB Output is correct
4 Correct 113 ms 10816 KB Output is correct
5 Correct 106 ms 12052 KB Output is correct
6 Correct 77 ms 10992 KB Output is correct
7 Correct 111 ms 10956 KB Output is correct
8 Correct 107 ms 11860 KB Output is correct
9 Correct 111 ms 12124 KB Output is correct
10 Correct 102 ms 10852 KB Output is correct
11 Correct 81 ms 10892 KB Output is correct
12 Correct 75 ms 11700 KB Output is correct
13 Correct 96 ms 11884 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 396 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 412 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 138 ms 10312 KB Output is correct
23 Correct 106 ms 10868 KB Output is correct
24 Correct 106 ms 11436 KB Output is correct
25 Correct 113 ms 10816 KB Output is correct
26 Correct 106 ms 12052 KB Output is correct
27 Correct 77 ms 10992 KB Output is correct
28 Correct 111 ms 10956 KB Output is correct
29 Correct 107 ms 11860 KB Output is correct
30 Correct 111 ms 12124 KB Output is correct
31 Correct 102 ms 10852 KB Output is correct
32 Correct 81 ms 10892 KB Output is correct
33 Correct 75 ms 11700 KB Output is correct
34 Correct 96 ms 11884 KB Output is correct
35 Correct 127 ms 10352 KB Output is correct
36 Correct 113 ms 11920 KB Output is correct
37 Correct 107 ms 12664 KB Output is correct
38 Correct 119 ms 12468 KB Output is correct
39 Correct 107 ms 12412 KB Output is correct
40 Correct 108 ms 12472 KB Output is correct
41 Correct 107 ms 12268 KB Output is correct
42 Correct 109 ms 12344 KB Output is correct
43 Correct 110 ms 11616 KB Output is correct
44 Correct 109 ms 11972 KB Output is correct
45 Correct 109 ms 12088 KB Output is correct
46 Correct 115 ms 13132 KB Output is correct
47 Correct 77 ms 11672 KB Output is correct
48 Correct 82 ms 11672 KB Output is correct
49 Correct 98 ms 10676 KB Output is correct
50 Correct 76 ms 11516 KB Output is correct
51 Correct 79 ms 11916 KB Output is correct
52 Correct 93 ms 11596 KB Output is correct