oj.uz

Submission #232726

# Submission time Handle Problem Language Result Execution time Memory
232726 2020-05-18T00:52:25 Z syy Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 177 ms 14768 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb push_back
#define all(v) v.begin(), v.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

ll n, q, s, t, arr[200005], inc[200005], l, r, x, ans; //up = -s, down = +t
ll ft[1000005];              // 1-index
ll ls(ll x){
	return (x & (-x));
}
// N means the largest possible index you need for the fenwick!! Refer to flowering for more.
void update(ll l, ll r, ll v){ // Updates from l to r inclusive
	r++;           // Update the difference at r+1 not r
	for(; l <= n; l += ls(l)) ft[l] += v;// Add v to the diff at l
	for(; r <= n; r += ls(r)) ft[r] -= v;// Minus v from diff at r+1
}
ll query(ll p){                     // Returns the element at p
	ll sum = 0;
	for(; p; p -= ls(p)) sum += ft[p];
	return sum; 
}

int main() {
	fastio; cin >> n >> q >> s >> t;
	cin >> arr[0];
	FOR(i, 1, n) {
		cin >> arr[i];
		update(i, i, arr[i]);
		ll pre = ans;
		if (arr[i] > arr[i-1]) ans -= s * (arr[i] - arr[i-1]);
		else ans += t * (arr[i-1] - arr[i]);
		inc[i] = ans - pre;
	}
	while (q--) {
		cin >> l >> r >> x;
		update(l, r, x);
		ll nh = query(l), change = 0;
		if (nh > query(l-1)) change -= s * (nh - query(l-1));
		else change += t * (query(l-1) - nh);
		ans += change - inc[l]; inc[l] = change;
		if (r != n) {
			change = 0;
			nh = query(r);
			if (query(r+1) > nh) change -= s * (query(r+1) - nh);
			else change += t * (nh - query(r+1));
			ans += change - inc[r+1]; inc[r+1] = change;
		}
		cout << ans << "\n";
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 11896 KB Output is correct
2 Correct 162 ms 12496 KB Output is correct
3 Correct 166 ms 13048 KB Output is correct
4 Correct 160 ms 12664 KB Output is correct
5 Correct 175 ms 13688 KB Output is correct
6 Correct 133 ms 12664 KB Output is correct
7 Correct 129 ms 12664 KB Output is correct
8 Correct 156 ms 13432 KB Output is correct
9 Correct 162 ms 13816 KB Output is correct
10 Correct 159 ms 12540 KB Output is correct
11 Correct 131 ms 12664 KB Output is correct
12 Correct 125 ms 13304 KB Output is correct
13 Correct 120 ms 13560 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 161 ms 11896 KB Output is correct
23 Correct 162 ms 12496 KB Output is correct
24 Correct 166 ms 13048 KB Output is correct
25 Correct 160 ms 12664 KB Output is correct
26 Correct 175 ms 13688 KB Output is correct
27 Correct 133 ms 12664 KB Output is correct
28 Correct 129 ms 12664 KB Output is correct
29 Correct 156 ms 13432 KB Output is correct
30 Correct 162 ms 13816 KB Output is correct
31 Correct 159 ms 12540 KB Output is correct
32 Correct 131 ms 12664 KB Output is correct
33 Correct 125 ms 13304 KB Output is correct
34 Correct 120 ms 13560 KB Output is correct
35 Correct 170 ms 12024 KB Output is correct
36 Correct 166 ms 13436 KB Output is correct
37 Correct 170 ms 14204 KB Output is correct
38 Correct 165 ms 14200 KB Output is correct
39 Correct 177 ms 14072 KB Output is correct
40 Correct 165 ms 14072 KB Output is correct
41 Correct 165 ms 13944 KB Output is correct
42 Correct 165 ms 13944 KB Output is correct
43 Correct 169 ms 13304 KB Output is correct
44 Correct 169 ms 13688 KB Output is correct
45 Correct 155 ms 13692 KB Output is correct
46 Correct 164 ms 14768 KB Output is correct
47 Correct 132 ms 13304 KB Output is correct
48 Correct 127 ms 13304 KB Output is correct
49 Correct 150 ms 12280 KB Output is correct
50 Correct 127 ms 13176 KB Output is correct
51 Correct 124 ms 13560 KB Output is correct
52 Correct 124 ms 13432 KB Output is correct