oj.uz

답안 #753623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753623 2023-06-05T14:53:50 Z ByeWorld Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 989 ms 19832 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef pair<int, pii> ipii;
const int MAXN = 2e5+10;
const int INF = 1e9;
const int MOD = 1e9+7;

int n, q, s, t;
int a[MAXN];
int up, dw;
int st[4*MAXN], laz[4*MAXN];

int bd(int id, int l, int r){
	if(l==r) return st[id] = a[l];
	return st[id] = bd(2*id, l, (l+r)/2) + bd(2*id+1, (l+r)/2+1, r);
}
void bnc(int id){
	if(laz[id] == 0) return;
	laz[2*id] += laz[id];
	st[2*id] += laz[id];
	laz[2*id+1] += laz[id];
	st[2*id+1] += laz[id];
	laz[id] = 0;
}
int que(int id, int l, int r, int x){
	if(r<x || x<l) return 0;
	if(l==r && l==x) return st[id];
	bnc(id);
	return que(2*id, l, (l+r)/2, x) + que(2*id+1, (l+r)/2+1, r, x);
}
int upd(int id, int l, int r, int x, int y, int p){
	if(r<x || y<l) return st[id];
	if(x<=l && r<=y){
		laz[id] += p;
		return st[id] += p;
	}
	bnc(id);
	return st[id] = upd(2*id, l, (l+r)/2, x, y, p) + upd(2*id+1, (l+r)/2+1, r, x, y, p);
}
signed main(){
	//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> q >> s >> t;
	for(int i=0; i<=n; i++) cin >> a[i];
	for(int i=1; i<=n; i++){
		int te = a[i]-a[i-1];
		if(te < 0) dw += te;
		else up += te;
	}
	bd(1, 1, n);

	for(int i=1; i<=q; i++){
		int l, r, p; cin >> l >> r >> p;
		int al = que(1, 1, n, l); int al1 = que(1, 1, n, l-1);
		int te = al-al1;
		if(te < 0) dw -= te;
		else up -= te;

		if(r!=n){
			int ar = que(1, 1, n, r); int ar1 = que(1, 1, n, r+1);
			te = ar1-ar;
			if(te < 0) dw -= te;
			else up -= te;
		}

		upd(1, 1, n, l, r, p);
		//cout << al << ' ' << al1 << ' ' << ar1 << ' '<< ar << "ar\n";
		al = que(1, 1, n, l);
		te = al-al1;
		if(te < 0) dw += te;
		else up += te;
		
		if(r!=n){
			int ar = que(1, 1, n, r); int ar1 = que(1, 1, n, r+1);
			te = ar1-ar;
			if(te < 0) dw += te;
			else up += te;
		}
	//cout << dw << ' ' << up << "dw\n";
		cout << dw*(-t) + up*(-s) << '\n';
	}
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 9 ms 464 KB Output is correct
4 Correct 8 ms 476 KB Output is correct
5 Correct 8 ms 464 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 8 ms 468 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 8 ms 448 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 7 ms 468 KB Output is correct
12 Correct 8 ms 444 KB Output is correct
13 Correct 5 ms 448 KB Output is correct
14 Correct 7 ms 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 9 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 899 ms 16900 KB Output is correct
2 Correct 913 ms 17520 KB Output is correct
3 Correct 910 ms 18136 KB Output is correct
4 Correct 968 ms 17708 KB Output is correct
5 Correct 936 ms 18668 KB Output is correct
6 Correct 560 ms 13684 KB Output is correct
7 Correct 536 ms 13516 KB Output is correct
8 Correct 780 ms 18380 KB Output is correct
9 Correct 775 ms 18748 KB Output is correct
10 Correct 775 ms 17516 KB Output is correct
11 Correct 666 ms 13504 KB Output is correct
12 Correct 547 ms 14288 KB Output is correct
13 Correct 582 ms 14472 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 9 ms 464 KB Output is correct
4 Correct 8 ms 476 KB Output is correct
5 Correct 8 ms 464 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 8 ms 468 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 8 ms 448 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 7 ms 468 KB Output is correct
12 Correct 8 ms 444 KB Output is correct
13 Correct 5 ms 448 KB Output is correct
14 Correct 7 ms 340 KB Output is correct
15 Correct 8 ms 340 KB Output is correct
16 Correct 9 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 899 ms 16900 KB Output is correct
23 Correct 913 ms 17520 KB Output is correct
24 Correct 910 ms 18136 KB Output is correct
25 Correct 968 ms 17708 KB Output is correct
26 Correct 936 ms 18668 KB Output is correct
27 Correct 560 ms 13684 KB Output is correct
28 Correct 536 ms 13516 KB Output is correct
29 Correct 780 ms 18380 KB Output is correct
30 Correct 775 ms 18748 KB Output is correct
31 Correct 775 ms 17516 KB Output is correct
32 Correct 666 ms 13504 KB Output is correct
33 Correct 547 ms 14288 KB Output is correct
34 Correct 582 ms 14472 KB Output is correct
35 Correct 989 ms 17096 KB Output is correct
36 Correct 898 ms 18452 KB Output is correct
37 Correct 866 ms 19264 KB Output is correct
38 Correct 873 ms 19136 KB Output is correct
39 Correct 863 ms 18972 KB Output is correct
40 Correct 875 ms 19024 KB Output is correct
41 Correct 887 ms 18844 KB Output is correct
42 Correct 900 ms 18924 KB Output is correct
43 Correct 917 ms 18284 KB Output is correct
44 Correct 892 ms 18632 KB Output is correct
45 Correct 912 ms 18720 KB Output is correct
46 Correct 918 ms 19832 KB Output is correct
47 Correct 609 ms 14212 KB Output is correct
48 Correct 743 ms 14172 KB Output is correct
49 Correct 860 ms 17288 KB Output is correct
50 Correct 692 ms 14092 KB Output is correct
51 Correct 564 ms 14408 KB Output is correct
52 Correct 706 ms 14300 KB Output is correct