oj.uz

Submission #899518

# Submission time Handle Problem Language Result Execution time Memory
899518 2024-01-06T11:15:34 Z oblantis Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 221 ms 13908 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
const ll inf = 1e18;
const int mod = 1e9+7;
const int maxn = 2e5 + 2;
int n, s, t, q;
int a[maxn], b[maxn], xl, xr, x, it;
ll y, l, ans;
int tr[maxn * 4];
void build(int v, int l, int r){
	if(l == r){
		tr[v] = a[l];
		return;
	}
	build(v * 2 + 1, l, (l + r) / 2), build(v * 2 + 2, (l + r) / 2 + 1, r);
}
void upd(int v, int l, int r){
	if(xl <= l && r <= xr){
		tr[v] += x;
		return;
	}
	if(r < xl || xr < l)return;
	upd(v * 2 + 1, l, (l + r) / 2), upd(v * 2 + 2, (l + r) / 2 + 1, r);
}
void get(int v, int l, int r){
	y += tr[v];
	if(l == r)return;
	if((l + r) / 2 >= it){
		get(v * 2 + 1, l, (l + r) / 2);
	}
	else get(v * 2 + 2, (l + r) / 2 + 1, r);
}
void fun(ll x, bool wt){
	if(x > 0)x = -x * s;
	else x = -x * t;
	if(wt)ans += x;
	else ans -= x;
}
void solve() {
	cin >> n >> q >> s >> t;
	for(int i = 0; i <= n; i++){
		cin >> a[i];
		if(i){
			b[i] = a[i] - a[i - 1];
			fun(b[i], 1);
		}
	}
	build(0, 0, n);
	while(q--){
		cin >> xl >> xr >> x;
		upd(0, 0, n);
		y = 0, it = xl;
		get(0, 0, n);
		l = y, it = it - 1, y = 0;
		get(0, 0, n);
		fun(b[xl], 0);
		b[xl] = l - y;
		fun(b[xl], 1);
		if(xr < n){
			it = xr + 1, y = 0;
			get(0, 0, n);
			l = y, it = it - 1, y = 0;
			get(0, 0, n);
			fun(b[xr + 1], 0);
			b[xr + 1] = l - y;
			fun(b[xr + 1], 1);
		}
		cout << ans << '\n';
	}
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 11852 KB Output is correct
2 Correct 200 ms 12412 KB Output is correct
3 Correct 202 ms 13156 KB Output is correct
4 Correct 221 ms 12516 KB Output is correct
5 Correct 200 ms 13724 KB Output is correct
6 Correct 103 ms 12648 KB Output is correct
7 Correct 86 ms 12368 KB Output is correct
8 Correct 172 ms 13376 KB Output is correct
9 Correct 184 ms 13908 KB Output is correct
10 Correct 172 ms 12624 KB Output is correct
11 Correct 130 ms 12412 KB Output is correct
12 Incorrect 88 ms 12928 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2596 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2536 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 2 ms 2536 KB Output is correct
12 Correct 2 ms 2520 KB Output is correct
13 Correct 1 ms 2600 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2572 KB Output is correct
16 Correct 2 ms 2524 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 2 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 201 ms 11852 KB Output is correct
23 Correct 200 ms 12412 KB Output is correct
24 Correct 202 ms 13156 KB Output is correct
25 Correct 221 ms 12516 KB Output is correct
26 Correct 200 ms 13724 KB Output is correct
27 Correct 103 ms 12648 KB Output is correct
28 Correct 86 ms 12368 KB Output is correct
29 Correct 172 ms 13376 KB Output is correct
30 Correct 184 ms 13908 KB Output is correct
31 Correct 172 ms 12624 KB Output is correct
32 Correct 130 ms 12412 KB Output is correct
33 Incorrect 88 ms 12928 KB Output isn't correct
34 Halted 0 ms 0 KB -