oj.uz

Submission #497108

# Submission time Handle Problem Language Result Execution time Memory
497108 2021-12-22T12:14:45 Z MohamedAhmed04 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 181 ms 6776 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 2e5 + 10 ;

int arr[MAX] ;
int n , q , s , t ;

long long bit[MAX] ;

void add(int i , int x)
{
	++i ;
	for(; i <= n+1 ; i += (i & (-i)))
		bit[i] += x ;
}

long long get(int i)
{
	++i ;
	long long sum = 0 ;
	for(; i > 0 ; i -= (i & (-i)))
		sum += bit[i] ;
	return sum ;
}

void update(int l , int r , int x)
{
	add(l , x) , add(r+1 , -x) ;
}

long long ans = 0 ;

void upd(int idx , int sgn)
{
	if(idx == n)
		return ;
	long long x = get(idx) , y = get(idx+1) ;
	if(x < y)
		ans -= (y - x) * s * sgn ;
	else
		ans += (x - y) * t * sgn ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>q>>s>>t ;
	for(int i = 0 ; i <= n ; ++i)
		cin>>arr[i] ;
	for(int i = 0 ; i <= n ; ++i)
		update(i , i , arr[i]) ;
	for(int i = 0 ; i < n ; ++i)
		upd(i , 1) ;
	while(q--)
	{
		int l , r , x ;
		cin>>l>>r>>x ;
		upd(l-1 , -1) , upd(r , -1) ;
		update(l , r , x) ;
		upd(l-1 , 1) , upd(r , 1) ;
		cout<<ans<<"\n" ;
	}
	return 0 ;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 372 KB Output is correct
8 Correct 2 ms 324 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 376 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 4284 KB Output is correct
2 Correct 140 ms 4876 KB Output is correct
3 Correct 129 ms 5552 KB Output is correct
4 Correct 181 ms 4632 KB Output is correct
5 Correct 138 ms 5452 KB Output is correct
6 Correct 98 ms 5800 KB Output is correct
7 Correct 112 ms 5784 KB Output is correct
8 Correct 148 ms 5744 KB Output is correct
9 Correct 140 ms 6052 KB Output is correct
10 Correct 137 ms 4724 KB Output is correct
11 Correct 110 ms 5852 KB Output is correct
12 Correct 98 ms 6228 KB Output is correct
13 Correct 95 ms 6524 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 372 KB Output is correct
8 Correct 2 ms 324 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 376 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 135 ms 4284 KB Output is correct
23 Correct 140 ms 4876 KB Output is correct
24 Correct 129 ms 5552 KB Output is correct
25 Correct 181 ms 4632 KB Output is correct
26 Correct 138 ms 5452 KB Output is correct
27 Correct 98 ms 5800 KB Output is correct
28 Correct 112 ms 5784 KB Output is correct
29 Correct 148 ms 5744 KB Output is correct
30 Correct 140 ms 6052 KB Output is correct
31 Correct 137 ms 4724 KB Output is correct
32 Correct 110 ms 5852 KB Output is correct
33 Correct 98 ms 6228 KB Output is correct
34 Correct 95 ms 6524 KB Output is correct
35 Correct 141 ms 4436 KB Output is correct
36 Correct 132 ms 5744 KB Output is correct
37 Correct 134 ms 6624 KB Output is correct
38 Correct 144 ms 6428 KB Output is correct
39 Correct 144 ms 6364 KB Output is correct
40 Correct 145 ms 6468 KB Output is correct
41 Correct 135 ms 6252 KB Output is correct
42 Correct 144 ms 6384 KB Output is correct
43 Correct 131 ms 5564 KB Output is correct
44 Correct 139 ms 5956 KB Output is correct
45 Correct 132 ms 5780 KB Output is correct
46 Correct 133 ms 6460 KB Output is correct
47 Correct 97 ms 6456 KB Output is correct
48 Correct 109 ms 6776 KB Output is correct
49 Correct 120 ms 5564 KB Output is correct
50 Correct 135 ms 6352 KB Output is correct
51 Correct 106 ms 6324 KB Output is correct
52 Correct 110 ms 6404 KB Output is correct