oj.uz

Submission #399684

# Submission time Handle Problem Language Result Execution time Memory
399684 2021-05-06T12:13:02 Z SavicS Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 435 ms 12316 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 200005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, q, S, T;
int niz[maxn];

ll A[maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n >> q >> S >> T;
	ff(i,0,n)cin >> niz[i];
	ff(i,1,n)A[i] = niz[i] - niz[i - 1];
	
	
	ll uk = 0;
	ff(i,1,n){
		if(A[i] >= 0)uk -= 1ll * S * A[i];
		else uk -= 1ll * T * A[i];
	}
	
	while(q--){
		int L, R, X;
		cin >> L >> R >> X;
		
		if(A[L] >= 0)uk += 1ll * S * A[L];
		else uk += 1ll * T * A[L];

		A[L] += X;
		
		if(A[L] >= 0)uk -= 1ll * S * A[L];
		else uk -= 1ll * T * A[L];
		
		
		if(R < n){
			
			if(A[R + 1] >= 0)uk += 1ll * S * A[R + 1];
			else uk += 1ll * T * A[R + 1];
			
			A[R + 1] -= X;
				
			if(A[R + 1] >= 0)uk -= 1ll * S * A[R + 1];
			else uk -= 1ll * T * A[R + 1];
				
		}
		
		cout << uk << endl;
		
	}
	
   	return 0;
}
/**

3 1 1 2
0 4 1 8
1 2 2


// probati bojenje sahovski ili slicno

**/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 5 ms 408 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 5 ms 332 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 5 ms 416 KB Output is correct
14 Correct 5 ms 332 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 5 ms 416 KB Output is correct
17 Correct 5 ms 332 KB Output is correct
18 Correct 5 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 304 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 416 ms 4420 KB Output is correct
2 Correct 423 ms 10028 KB Output is correct
3 Correct 422 ms 10704 KB Output is correct
4 Correct 414 ms 10072 KB Output is correct
5 Correct 417 ms 11432 KB Output is correct
6 Correct 403 ms 10272 KB Output is correct
7 Correct 405 ms 10332 KB Output is correct
8 Correct 419 ms 11076 KB Output is correct
9 Correct 417 ms 11372 KB Output is correct
10 Correct 417 ms 10180 KB Output is correct
11 Correct 398 ms 10052 KB Output is correct
12 Correct 405 ms 10880 KB Output is correct
13 Correct 401 ms 11096 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 5 ms 408 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 5 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 5 ms 332 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 5 ms 416 KB Output is correct
14 Correct 5 ms 332 KB Output is correct
15 Correct 5 ms 332 KB Output is correct
16 Correct 5 ms 416 KB Output is correct
17 Correct 5 ms 332 KB Output is correct
18 Correct 5 ms 336 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 416 ms 4420 KB Output is correct
23 Correct 423 ms 10028 KB Output is correct
24 Correct 422 ms 10704 KB Output is correct
25 Correct 414 ms 10072 KB Output is correct
26 Correct 417 ms 11432 KB Output is correct
27 Correct 403 ms 10272 KB Output is correct
28 Correct 405 ms 10332 KB Output is correct
29 Correct 419 ms 11076 KB Output is correct
30 Correct 417 ms 11372 KB Output is correct
31 Correct 417 ms 10180 KB Output is correct
32 Correct 398 ms 10052 KB Output is correct
33 Correct 405 ms 10880 KB Output is correct
34 Correct 401 ms 11096 KB Output is correct
35 Correct 416 ms 9552 KB Output is correct
36 Correct 417 ms 11076 KB Output is correct
37 Correct 420 ms 11972 KB Output is correct
38 Correct 423 ms 11716 KB Output is correct
39 Correct 428 ms 11588 KB Output is correct
40 Correct 432 ms 11584 KB Output is correct
41 Correct 427 ms 11460 KB Output is correct
42 Correct 422 ms 11508 KB Output is correct
43 Correct 422 ms 10960 KB Output is correct
44 Correct 418 ms 11216 KB Output is correct
45 Correct 418 ms 11240 KB Output is correct
46 Correct 435 ms 12316 KB Output is correct
47 Correct 402 ms 11020 KB Output is correct
48 Correct 400 ms 10972 KB Output is correct
49 Correct 409 ms 9932 KB Output is correct
50 Correct 405 ms 10740 KB Output is correct
51 Correct 408 ms 11080 KB Output is correct
52 Correct 400 ms 10940 KB Output is correct