oj.uz

Submission #383168

# Submission time Handle Problem Language Result Execution time Memory
383168 2021-03-29T01:04:17 Z MODDI Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 980 ms 35048 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n, q, s, t;
vi arr;
class klas{
	public:
		ll l;
		ll r;
		ll temp;
};
vector<klas> tree(4 * 200000);
ll lazy[4 * 200000];
void build(int node, int l, int r){
	if(l == r){
		//cout<<l<<endl;
		if(l == n + 1)	return;
		klas cur;
		cur.l = arr[l];
		cur.r = arr[l];
		cur.temp = 0;
		tree[node] = cur;
	}
	else{
		int mid = (l + r) / 2;
		build(node * 2, l, mid);
		build(node * 2 + 1, mid + 1, r);
		klas next;
		next.l = tree[node * 2].l;
		next.r = tree[node * 2 + 1].r;
		next.temp =tree[node * 2].temp + tree[node * 2 + 1].temp;
		if(tree[node * 2].r < tree[node * 2 + 1].l){
			ll diff = tree[node * 2 + 1].l - tree[node * 2].r;
			next.temp= next.temp - diff * s;
			//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
		}
		else if(tree[node * 2].r > tree[node * 2  + 1].l){
			ll diff = tree[node * 2].r - tree[node * 2 + 1].l;
			next.temp = next.temp + diff * t;
			//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
		}
		tree[node] = next;
 	}
}
/*void update(int node, int l, int r, int pos, int x){
	if(l == r && l == pos)
	{
		tree[node].l += x;
		tree[node].r += x;
	}
	else{
		int mid = (l + r) / 2;
		if(pos <= mid)
			update(node * 2, l, mid, pos, x);
		else
			update(node * 2 + 1, mid + 1, r, pos, x);
			
		klas next;
		next.l = tree[node * 2].l;
		next.r = tree[node * 2 + 1].r;
		next.temp =tree[node * 2].temp + tree[node * 2 + 1].temp;
		if(tree[node * 2].r < tree[node * 2 + 1].l){
			int diff = tree[node * 2 + 1].l - tree[node * 2].r;
			next.temp= next.temp - diff * s;
			//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
		}
		else if(tree[node * 2].r > tree[node * 2  + 1].l){
			int diff = tree[node * 2].r - tree[node * 2 + 1].l;
			next.temp = next.temp + diff * t;
			//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
		}
		tree[node] = next;
	}
}*/
void update(int node, int l, int r, int L, int R, int x){
	if(lazy[node] != 0){
		tree[node].l += lazy[node];
		tree[node].r += lazy[node];
		if(l != r){
			lazy[node * 2] += lazy[node];
			lazy[node * 2 + 1] += lazy[node];
		}
		lazy[node] = 0;
	}
	if(r < L || R < l)	return;
	if(L <= l && r <= R){
		tree[node].l += x;
		tree[node].r += x;
		if(l != r){
			lazy[node * 2] += x;
			lazy[node * 2 + 1] += x;
		}
		return;
	}
	int mid = (l + r) / 2;
	update(node * 2, l, mid, L, R, x);
	update(node * 2 + 1, mid + 1, r, L, R, x);
	klas next;
	next.l = tree[node * 2].l;
	next.r = tree[node * 2 + 1].r;
	next.temp = tree[node * 2].temp + tree[node * 2 + 1].temp;
	if(tree[node * 2].r < tree[node * 2 + 1].l){
		ll diff = tree[node * 2 + 1].l - tree[node * 2].r;
		next.temp= next.temp - diff * s;
		//cout<<diff<<" "<<tree[node * 2].r<<" "<<tree[node * 2 + 1].l<<endl;
		//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
	}
	else if(tree[node * 2].r > tree[node * 2  + 1].l){
		ll diff = tree[node * 2].r - tree[node * 2 + 1].l;
		next.temp = next.temp + diff * t;
		//cout<<diff<<" "<<tree[node * 2].r<<" "<<tree[node * 2 + 1].l<<endl;
		//cout<<tree[node * 2 + 1].l <<" "<<tree[node * 2].r<<endl;
	}
	tree[node] = next;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	memset(lazy, 0, sizeof(lazy));
	cin>>n>>q>>s>>t;
	for(int i = 0; i <=n; i++){
		int a;
		cin>>a;
		arr.pb(a);
	}
	build(1, 0, n);
	//cout<<tree[1].temp<<endl;
	while(q--){
		int a, b, x;
		cin>>a>>b>>x;
		update(1, 0, n, a, b, x);
		cout<<tree[1].temp<<endl;
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 25452 KB Output is correct
2 Correct 22 ms 25452 KB Output is correct
3 Correct 22 ms 25452 KB Output is correct
4 Correct 22 ms 25452 KB Output is correct
5 Correct 22 ms 25452 KB Output is correct
6 Correct 24 ms 25580 KB Output is correct
7 Correct 22 ms 25452 KB Output is correct
8 Correct 22 ms 25452 KB Output is correct
9 Correct 22 ms 25452 KB Output is correct
10 Correct 23 ms 25452 KB Output is correct
11 Correct 23 ms 25452 KB Output is correct
12 Correct 22 ms 25452 KB Output is correct
13 Correct 23 ms 25468 KB Output is correct
14 Correct 23 ms 25452 KB Output is correct
15 Correct 22 ms 25452 KB Output is correct
16 Correct 21 ms 25452 KB Output is correct
17 Correct 21 ms 25452 KB Output is correct
18 Correct 22 ms 25452 KB Output is correct
19 Correct 15 ms 25324 KB Output is correct
20 Correct 15 ms 25324 KB Output is correct
21 Correct 15 ms 25324 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 937 ms 28040 KB Output is correct
2 Correct 963 ms 31220 KB Output is correct
3 Correct 931 ms 31844 KB Output is correct
4 Correct 931 ms 31060 KB Output is correct
5 Correct 980 ms 31820 KB Output is correct
6 Correct 669 ms 32252 KB Output is correct
7 Correct 618 ms 32104 KB Output is correct
8 Correct 860 ms 32104 KB Output is correct
9 Correct 831 ms 32360 KB Output is correct
10 Correct 838 ms 31464 KB Output is correct
11 Correct 642 ms 32232 KB Output is correct
12 Correct 629 ms 32744 KB Output is correct
13 Correct 624 ms 32920 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 25452 KB Output is correct
2 Correct 22 ms 25452 KB Output is correct
3 Correct 22 ms 25452 KB Output is correct
4 Correct 22 ms 25452 KB Output is correct
5 Correct 22 ms 25452 KB Output is correct
6 Correct 24 ms 25580 KB Output is correct
7 Correct 22 ms 25452 KB Output is correct
8 Correct 22 ms 25452 KB Output is correct
9 Correct 22 ms 25452 KB Output is correct
10 Correct 23 ms 25452 KB Output is correct
11 Correct 23 ms 25452 KB Output is correct
12 Correct 22 ms 25452 KB Output is correct
13 Correct 23 ms 25468 KB Output is correct
14 Correct 23 ms 25452 KB Output is correct
15 Correct 22 ms 25452 KB Output is correct
16 Correct 21 ms 25452 KB Output is correct
17 Correct 21 ms 25452 KB Output is correct
18 Correct 22 ms 25452 KB Output is correct
19 Correct 15 ms 25324 KB Output is correct
20 Correct 15 ms 25324 KB Output is correct
21 Correct 15 ms 25324 KB Output is correct
22 Correct 937 ms 28040 KB Output is correct
23 Correct 963 ms 31220 KB Output is correct
24 Correct 931 ms 31844 KB Output is correct
25 Correct 931 ms 31060 KB Output is correct
26 Correct 980 ms 31820 KB Output is correct
27 Correct 669 ms 32252 KB Output is correct
28 Correct 618 ms 32104 KB Output is correct
29 Correct 860 ms 32104 KB Output is correct
30 Correct 831 ms 32360 KB Output is correct
31 Correct 838 ms 31464 KB Output is correct
32 Correct 642 ms 32232 KB Output is correct
33 Correct 629 ms 32744 KB Output is correct
34 Correct 624 ms 32920 KB Output is correct
35 Correct 950 ms 30824 KB Output is correct
36 Correct 915 ms 32232 KB Output is correct
37 Correct 955 ms 33000 KB Output is correct
38 Correct 929 ms 32912 KB Output is correct
39 Correct 924 ms 32872 KB Output is correct
40 Correct 932 ms 32872 KB Output is correct
41 Correct 932 ms 32744 KB Output is correct
42 Correct 924 ms 32744 KB Output is correct
43 Correct 921 ms 32552 KB Output is correct
44 Correct 915 ms 34744 KB Output is correct
45 Correct 912 ms 35048 KB Output is correct
46 Correct 918 ms 33000 KB Output is correct
47 Correct 622 ms 33000 KB Output is correct
48 Correct 621 ms 33128 KB Output is correct
49 Correct 895 ms 32104 KB Output is correct
50 Correct 646 ms 32872 KB Output is correct
51 Correct 632 ms 32752 KB Output is correct
52 Correct 689 ms 32744 KB Output is correct