oj.uz

Submission #879613

# Submission time Handle Problem Language Result Execution time Memory
879613 2023-11-27T18:01:52 Z iskhakkutbilim Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 416 ms 14508 KB 
#include <bits/stdc++.h>
using namespace std;
// Tazhibaev Iskhak
// call me, if scholarship $$ is at least ELON_MUSK_MAX
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 1e9 + 7;
const int N = 2e5;

int n, q, S, T;
int lazy[4*N], t[4*N];
int a[N+10];
void push(int v, int vl, int vr){
	if(!lazy[v]) return;
	t[v]+= (lazy[v] * (vr-vl+1));
	if(vl != vr){
		lazy[v<<1]+= lazy[v];
		lazy[v<<1|1]+= lazy[v];	
	}
	lazy[v] = 0;
}

void add(int l, int r, int x, int v, int vl, int vr){
	push(v, vl, vr);
	if(l > vr or vl > r) return;
	if(l <= vl && r >= vr){
		lazy[v]+= x;
		push(v, vl, vr);
		return;
	}
	int mid = (vl + vr)>>1;
	add(l, r, x, v<<1, vl, mid);
	add(l, r, x, v<<1|1, mid+1, vr);
}

int get(int pos, int v, int vl, int vr){
	push(v, vl, vr);
	if(vl == vr) return t[v];
	int mid = (vl + vr)>>1;
	if(mid >= pos) return get(pos, v<<1, vl, mid);
	else return get(pos, v<<1|1, mid+1, vr);
}

int sum;


void inv_degree(int idx){
	int A;
	int B = get(idx, 1, 1, n);
	if(idx == 1) A = 0;
	else A = get(idx-1, 1, 1, n);
	if(B > A){
		sum+= S * abs(B-A);
	}else{
		sum-= T * abs(B-A);
	}
}


void degree(int idx){
	int A;
	int B = get(idx, 1, 1, n);
	if(idx == 1) A = 0;
	else A = get(idx-1, 1, 1, n);
	if(B > A){
		sum-= S * abs(B-A);
	}else{
		sum+= T * abs(B-A);
	}
}

signed main(){
	ios::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];
		add(i, i, a[i], 1, 1, n);
	}
	for(int i = 1;i <= n; i++){
		degree(i);
	}
	while(q--){
		int l, r, x; cin >> l >> r >> x;
		if(r + 1 <= n) inv_degree(r+1);
		inv_degree(l);
		add(l, r, x, 1, 1, n);
		if(r+1 <= n){
			degree(r+1);
		}
		degree(l);	
		cout << sum << '\n';
	}
	
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 3 ms 2516 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 3 ms 2392 KB Output is correct
11 Correct 5 ms 2396 KB Output is correct
12 Correct 3 ms 2520 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 12340 KB Output is correct
2 Correct 370 ms 12912 KB Output is correct
3 Correct 408 ms 13396 KB Output is correct
4 Correct 365 ms 12628 KB Output is correct
5 Correct 416 ms 13396 KB Output is correct
6 Correct 146 ms 12884 KB Output is correct
7 Correct 142 ms 12680 KB Output is correct
8 Correct 309 ms 13648 KB Output is correct
9 Correct 331 ms 13904 KB Output is correct
10 Correct 313 ms 12752 KB Output is correct
11 Correct 197 ms 12868 KB Output is correct
12 Correct 140 ms 13192 KB Output is correct
13 Correct 165 ms 13700 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 3 ms 2516 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 3 ms 2392 KB Output is correct
11 Correct 5 ms 2396 KB Output is correct
12 Correct 3 ms 2520 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 374 ms 12340 KB Output is correct
23 Correct 370 ms 12912 KB Output is correct
24 Correct 408 ms 13396 KB Output is correct
25 Correct 365 ms 12628 KB Output is correct
26 Correct 416 ms 13396 KB Output is correct
27 Correct 146 ms 12884 KB Output is correct
28 Correct 142 ms 12680 KB Output is correct
29 Correct 309 ms 13648 KB Output is correct
30 Correct 331 ms 13904 KB Output is correct
31 Correct 313 ms 12752 KB Output is correct
32 Correct 197 ms 12868 KB Output is correct
33 Correct 140 ms 13192 KB Output is correct
34 Correct 165 ms 13700 KB Output is correct
35 Correct 367 ms 12368 KB Output is correct
36 Correct 384 ms 13908 KB Output is correct
37 Correct 371 ms 14508 KB Output is correct
38 Correct 378 ms 14436 KB Output is correct
39 Correct 370 ms 14424 KB Output is correct
40 Correct 377 ms 14416 KB Output is correct
41 Correct 376 ms 14168 KB Output is correct
42 Correct 376 ms 14420 KB Output is correct
43 Correct 377 ms 13484 KB Output is correct
44 Correct 374 ms 14076 KB Output is correct
45 Correct 384 ms 13904 KB Output is correct
46 Correct 386 ms 14472 KB Output is correct
47 Correct 145 ms 13460 KB Output is correct
48 Correct 184 ms 13688 KB Output is correct
49 Correct 385 ms 13652 KB Output is correct
50 Correct 197 ms 13456 KB Output is correct
51 Correct 141 ms 13396 KB Output is correct
52 Correct 209 ms 13356 KB Output is correct