oj.uz

Submission #385804

# Submission time Handle Problem Language Result Execution time Memory
385804 2021-04-05T01:19:46 Z idontreallyknow Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 160 ms 13164 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class A> ostream& operator<<(ostream &cout, vector<A> const &v) {cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";};
template<class A, class B> ostream& operator<<(ostream &cout, const pair<A,B> &x) {return cout << "(" <<x.first << ", " << x.second << ")";};
template <class T> void pv(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) cerr << *i << " "; cerr << "]\n";}
void _print() {cerr << "]\n";}
template <class T, class... V> void _print(T t, V... v) {cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define fi first
#define se second
#define SZ(x) (int)((x).size())
#define pii pair<int,int>

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n,qq,s,t;
	cin >> n >> qq >> s >> t;
	ll a[n+1];
	for (int q = 0; q <= n; q++) cin >> a[q];
	ll dif[n+1];
	for (int q = 1; q <= n; q++) dif[q] = a[q]-a[q-1];
	ll cur = 0;
	for (int q = 1; q <= n; q++) {
		if (dif[q] >= 0) cur -= s*dif[q];
		else cur -= t*dif[q];
	}
	while (qq--) {
		ll l,r,x;
		cin >> l >> r >> x;
		if (dif[l] >= 0) cur += s*dif[l];
		else cur += t*dif[l];
		dif[l] += x;
		if (dif[l] >= 0) cur -= s*dif[l];
		else cur -= t*dif[l];
		if (r < n) {
			if (dif[r+1] >= 0) cur += s*dif[r+1];
			else cur += t*dif[r+1];
			dif[r+1] -= x;
			if (dif[r+1] >= 0) cur -= s*dif[r+1];
			else cur -= t*dif[r+1];
		}
		cout << cur << "\n";
	}
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 10348 KB Output is correct
2 Correct 126 ms 11116 KB Output is correct
3 Correct 119 ms 11500 KB Output is correct
4 Correct 116 ms 10880 KB Output is correct
5 Correct 124 ms 12012 KB Output is correct
6 Correct 102 ms 11116 KB Output is correct
7 Correct 108 ms 11116 KB Output is correct
8 Correct 142 ms 11884 KB Output is correct
9 Correct 119 ms 12268 KB Output is correct
10 Correct 124 ms 11116 KB Output is correct
11 Correct 97 ms 10988 KB Output is correct
12 Correct 103 ms 11756 KB Output is correct
13 Correct 103 ms 11884 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 160 ms 10348 KB Output is correct
23 Correct 126 ms 11116 KB Output is correct
24 Correct 119 ms 11500 KB Output is correct
25 Correct 116 ms 10880 KB Output is correct
26 Correct 124 ms 12012 KB Output is correct
27 Correct 102 ms 11116 KB Output is correct
28 Correct 108 ms 11116 KB Output is correct
29 Correct 142 ms 11884 KB Output is correct
30 Correct 119 ms 12268 KB Output is correct
31 Correct 124 ms 11116 KB Output is correct
32 Correct 97 ms 10988 KB Output is correct
33 Correct 103 ms 11756 KB Output is correct
34 Correct 103 ms 11884 KB Output is correct
35 Correct 122 ms 10496 KB Output is correct
36 Correct 121 ms 11884 KB Output is correct
37 Correct 134 ms 12780 KB Output is correct
38 Correct 125 ms 12524 KB Output is correct
39 Correct 133 ms 12524 KB Output is correct
40 Correct 127 ms 12424 KB Output is correct
41 Correct 122 ms 12268 KB Output is correct
42 Correct 135 ms 12524 KB Output is correct
43 Correct 118 ms 11628 KB Output is correct
44 Correct 130 ms 12268 KB Output is correct
45 Correct 125 ms 12140 KB Output is correct
46 Correct 124 ms 13164 KB Output is correct
47 Correct 104 ms 11884 KB Output is correct
48 Correct 106 ms 11756 KB Output is correct
49 Correct 111 ms 10732 KB Output is correct
50 Correct 106 ms 11628 KB Output is correct
51 Correct 104 ms 11884 KB Output is correct
52 Correct 100 ms 11884 KB Output is correct