oj.uz

Submission #670922

# Submission time Handle Problem Language Result Execution time Memory
670922 2022-12-11T10:39:48 Z Kahou Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 151 ms 7244 KB 
/* In the name of God, aka Allah */
// let this be mytemp.cpp
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 2e5 + 50;
ll n, q, s, t, a[N], sm[2];
ll fen[N];

ll get(int i) {
	ll out = 0;
	for (; i > 0; i -= i&-i) {
		out += fen[i];
	}
	return out;
}
void upd(int i, ll x) {
	for (; i <= n; i += i&-i) {
		fen[i] += x;
	}
}

void solve() {
	cin >> n >> q >> s >> t;
	s = -s;
	t = -t;
	for (int i = 0; i <= n; i++) {
		cin >> a[i];
		if (i > 0) {
			sm[(a[i] > a[i-1])] += a[i]-a[i-1];
			upd(i, a[i]-get(i-1));
		}
	}
	
	while (q--) {
		ll l, r, x;
		cin >> l >> r >> x;
		sm[(get(l) > get(l-1))] -= get(l)-get(l-1);
		if (r < n) sm[(get(r+1) > get(r))] -= get(r+1)-get(r);
		upd(l, x);
		upd(r+1, -x);
		sm[(get(l) > get(l-1))] += get(l)-get(l-1);
		if (r < n) sm[(get(r+1) > get(r))] += get(r+1)-get(r);
		
		cout << sm[0]*t + sm[1]*s << endl;
	}
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 5076 KB Output is correct
2 Correct 130 ms 5452 KB Output is correct
3 Correct 132 ms 6016 KB Output is correct
4 Correct 135 ms 5288 KB Output is correct
5 Correct 132 ms 5892 KB Output is correct
6 Correct 81 ms 6424 KB Output is correct
7 Correct 86 ms 6292 KB Output is correct
8 Correct 127 ms 6336 KB Output is correct
9 Correct 121 ms 6604 KB Output is correct
10 Correct 116 ms 5412 KB Output is correct
11 Correct 99 ms 6456 KB Output is correct
12 Correct 92 ms 6808 KB Output is correct
13 Correct 82 ms 7160 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 141 ms 5076 KB Output is correct
23 Correct 130 ms 5452 KB Output is correct
24 Correct 132 ms 6016 KB Output is correct
25 Correct 135 ms 5288 KB Output is correct
26 Correct 132 ms 5892 KB Output is correct
27 Correct 81 ms 6424 KB Output is correct
28 Correct 86 ms 6292 KB Output is correct
29 Correct 127 ms 6336 KB Output is correct
30 Correct 121 ms 6604 KB Output is correct
31 Correct 116 ms 5412 KB Output is correct
32 Correct 99 ms 6456 KB Output is correct
33 Correct 92 ms 6808 KB Output is correct
34 Correct 82 ms 7160 KB Output is correct
35 Correct 137 ms 4964 KB Output is correct
36 Correct 136 ms 6348 KB Output is correct
37 Correct 134 ms 7212 KB Output is correct
38 Correct 151 ms 7052 KB Output is correct
39 Correct 134 ms 7016 KB Output is correct
40 Correct 134 ms 6948 KB Output is correct
41 Correct 142 ms 6816 KB Output is correct
42 Correct 136 ms 6888 KB Output is correct
43 Correct 132 ms 6224 KB Output is correct
44 Correct 142 ms 6564 KB Output is correct
45 Correct 134 ms 6400 KB Output is correct
46 Correct 138 ms 7052 KB Output is correct
47 Correct 82 ms 6944 KB Output is correct
48 Correct 100 ms 7244 KB Output is correct
49 Correct 127 ms 6208 KB Output is correct
50 Correct 97 ms 6956 KB Output is correct
51 Correct 82 ms 7024 KB Output is correct
52 Correct 92 ms 6900 KB Output is correct