oj.uz

답안 #1001143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001143 2024-06-18T15:38:10 Z vjudge3 Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 440 ms 23268 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll a[200005], s, t;
int n;

struct Node {
	ll x, lz;
} seg[800005];

void build (int id, int l, int r) {
	if (l == r) {
		seg[id].x = a[l];
		return;
	}
	build(id*2, l, (l+r)/2);
	build(id*2+1, (l+r)/2+1, r);
}

void push (int id) {
	seg[id].x += seg[id].lz;
	if (id <= n*2) {
		seg[id*2].lz += seg[id].lz;
		seg[id*2+1].lz += seg[id].lz;
	}
	seg[id].lz = 0;
}

void upd (int id, int l, int r, int ql, int qr, ll val) {
	push(id);
	if (qr < l || r < ql) return;
	if (ql <= l && r <= qr) {
		seg[id].lz += val;
		push(id);
		return;
	}
	upd(id*2, l, (l+r)/2, ql, qr, val);
	upd(id*2+1, (l+r)/2+1, r, ql, qr, val);
}

ll query (int id, int l, int r, int idx) {
	push(id);
	if (l == r) return seg[id].x;
	int mid = (l+r)/2;
	if (mid < idx) return query(id*2+1, mid+1, r, idx);
	return query(id*2, l, mid, idx);
}

ll upd (int idx) {
	int cur = query(1, 1, n, idx);
	int prv = idx == 1 ? 0 : query(1, 1, n, idx-1);
	int nxt = idx == n ? cur : query(1, 1, n, idx+1);
	ll res = 0;
	if (prv < cur) res -= (cur - prv) * s;
	else res += (prv - cur) * t;
	if (cur < nxt) res -= (nxt - cur) * s;
	else res += (cur - nxt) * t;
	return res;
}

int main () {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int q;
	cin >> n >> q >> s >> t >> a[0];
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (a[i-1] < a[i]) ans -= (a[i] - a[i-1]) * s;
		else ans += (a[i-1] - a[i]) * t;
	}
	build(1, 1, n);
	while (q--) {
		int l, r;
		ll x;
		cin >> l >> r >> x;
		ans -= upd(l) + (l == r ? 0 : upd(r));
		upd(1, 1, n, l, r, x);
		ans += upd(l) + (l == r ? 0 : upd(r));
		cout << ans << '\n';
	}
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 21332 KB Output is correct
2 Correct 440 ms 21900 KB Output is correct
3 Correct 397 ms 22356 KB Output is correct
4 Correct 397 ms 21868 KB Output is correct
5 Correct 411 ms 23268 KB Output is correct
6 Correct 204 ms 17748 KB Output is correct
7 Correct 204 ms 17820 KB Output is correct
8 Correct 364 ms 22864 KB Output is correct
9 Correct 366 ms 23120 KB Output is correct
10 Correct 359 ms 21844 KB Output is correct
11 Correct 240 ms 17620 KB Output is correct
12 Incorrect 204 ms 18128 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 403 ms 21332 KB Output is correct
23 Correct 440 ms 21900 KB Output is correct
24 Correct 397 ms 22356 KB Output is correct
25 Correct 397 ms 21868 KB Output is correct
26 Correct 411 ms 23268 KB Output is correct
27 Correct 204 ms 17748 KB Output is correct
28 Correct 204 ms 17820 KB Output is correct
29 Correct 364 ms 22864 KB Output is correct
30 Correct 366 ms 23120 KB Output is correct
31 Correct 359 ms 21844 KB Output is correct
32 Correct 240 ms 17620 KB Output is correct
33 Incorrect 204 ms 18128 KB Output isn't correct
34 Halted 0 ms 0 KB -