oj.uz

Submission #484695

# Submission time Handle Problem Language Result Execution time Memory
484695 2021-11-05T05:49:36 Z Haruto810198 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 96 ms 13028 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 200010;

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

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	
	cin>>n>>q>>s>>t;
	
	FOR(i, 0, n, 1){
		cin>>arr[i];
	}

	FOR(i, 1, n, 1){
		dif[i] = arr[i] - arr[i - 1];
		if(dif[i] > 0) res -= s * dif[i];
		else res -= t * dif[i];
	}
	
	//cerr<<res<<'\n';

	while(q--){
		int l, r, d;
		cin>>l>>r>>d;
		
		if(dif[l] > 0) res += s * dif[l];
		else res += t * dif[l];
		if(dif[r + 1] > 0) res += s * dif[r + 1];
		else res += t * dif[r + 1];

		dif[l] += d;
		if(r + 1 <= n) dif[r + 1] -= d;
		
		if(dif[l] > 0) res -= s * dif[l];
		else res -= t * dif[l];
		if(dif[r + 1] > 0) res -= s * dif[r + 1];
		else res -= t * dif[r + 1];
		
		cout<<res<<'\n';
	}
	
    return 0;

}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10172 KB Output is correct
2 Correct 87 ms 10872 KB Output is correct
3 Correct 88 ms 11392 KB Output is correct
4 Correct 87 ms 10768 KB Output is correct
5 Correct 88 ms 11912 KB Output is correct
6 Correct 77 ms 11004 KB Output is correct
7 Correct 76 ms 11044 KB Output is correct
8 Correct 90 ms 11820 KB Output is correct
9 Correct 94 ms 12080 KB Output is correct
10 Correct 85 ms 10820 KB Output is correct
11 Correct 78 ms 10820 KB Output is correct
12 Correct 82 ms 11672 KB Output is correct
13 Correct 74 ms 11844 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 90 ms 10172 KB Output is correct
23 Correct 87 ms 10872 KB Output is correct
24 Correct 88 ms 11392 KB Output is correct
25 Correct 87 ms 10768 KB Output is correct
26 Correct 88 ms 11912 KB Output is correct
27 Correct 77 ms 11004 KB Output is correct
28 Correct 76 ms 11044 KB Output is correct
29 Correct 90 ms 11820 KB Output is correct
30 Correct 94 ms 12080 KB Output is correct
31 Correct 85 ms 10820 KB Output is correct
32 Correct 78 ms 10820 KB Output is correct
33 Correct 82 ms 11672 KB Output is correct
34 Correct 74 ms 11844 KB Output is correct
35 Correct 89 ms 10420 KB Output is correct
36 Correct 90 ms 11840 KB Output is correct
37 Correct 92 ms 12560 KB Output is correct
38 Correct 91 ms 12428 KB Output is correct
39 Correct 96 ms 12476 KB Output is correct
40 Correct 96 ms 12540 KB Output is correct
41 Correct 89 ms 12224 KB Output is correct
42 Correct 90 ms 12376 KB Output is correct
43 Correct 88 ms 11716 KB Output is correct
44 Correct 90 ms 11972 KB Output is correct
45 Correct 95 ms 11968 KB Output is correct
46 Correct 87 ms 13028 KB Output is correct
47 Correct 80 ms 11588 KB Output is correct
48 Correct 77 ms 11596 KB Output is correct
49 Correct 80 ms 10608 KB Output is correct
50 Correct 77 ms 11460 KB Output is correct
51 Correct 77 ms 11856 KB Output is correct
52 Correct 73 ms 11668 KB Output is correct