oj.uz

답안 #899520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899520 2024-01-06T11:16:18 Z oblantis Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 220 ms 19428 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;
ll a[maxn], b[maxn], xl, xr, x, it;
ll y, l, ans;
ll 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4560 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 11264 KB Output is correct
2 Correct 213 ms 11848 KB Output is correct
3 Correct 204 ms 12372 KB Output is correct
4 Correct 204 ms 11604 KB Output is correct
5 Correct 220 ms 12184 KB Output is correct
6 Correct 89 ms 12624 KB Output is correct
7 Correct 89 ms 12408 KB Output is correct
8 Correct 184 ms 12628 KB Output is correct
9 Correct 185 ms 12880 KB Output is correct
10 Correct 171 ms 11620 KB Output is correct
11 Correct 107 ms 12540 KB Output is correct
12 Correct 88 ms 12932 KB Output is correct
13 Correct 93 ms 18032 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4560 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 204 ms 11264 KB Output is correct
23 Correct 213 ms 11848 KB Output is correct
24 Correct 204 ms 12372 KB Output is correct
25 Correct 204 ms 11604 KB Output is correct
26 Correct 220 ms 12184 KB Output is correct
27 Correct 89 ms 12624 KB Output is correct
28 Correct 89 ms 12408 KB Output is correct
29 Correct 184 ms 12628 KB Output is correct
30 Correct 185 ms 12880 KB Output is correct
31 Correct 171 ms 11620 KB Output is correct
32 Correct 107 ms 12540 KB Output is correct
33 Correct 88 ms 12932 KB Output is correct
34 Correct 93 ms 18032 KB Output is correct
35 Correct 217 ms 16720 KB Output is correct
36 Correct 216 ms 18248 KB Output is correct
37 Correct 220 ms 19096 KB Output is correct
38 Correct 219 ms 18884 KB Output is correct
39 Correct 211 ms 18768 KB Output is correct
40 Correct 211 ms 18868 KB Output is correct
41 Correct 215 ms 18588 KB Output is correct
42 Correct 215 ms 18756 KB Output is correct
43 Correct 212 ms 17820 KB Output is correct
44 Correct 217 ms 18500 KB Output is correct
45 Correct 203 ms 18260 KB Output is correct
46 Correct 209 ms 19428 KB Output is correct
47 Correct 99 ms 17912 KB Output is correct
48 Correct 102 ms 17712 KB Output is correct
49 Correct 205 ms 17212 KB Output is correct
50 Correct 107 ms 17764 KB Output is correct
51 Correct 90 ms 17976 KB Output is correct
52 Correct 118 ms 18084 KB Output is correct