oj.uz

Submission #51482

# Submission time Handle Problem Language Result Execution time Memory
51482 2018-06-18T03:54:10 Z Vinhspm Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 856 ms 10140 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define fi first
#define se second
#define pb push_back
const int N = 2*1e5 + 10;
const int oo = 1e9;
const int mod = 1e9 + 7;
int n, q, de, inc, sum;
int node[N], la[4*N + 1];
void true_val(int i, int l, int r)	{
	if(l > r || !la[i]) return;
	if(l == r) node[l] += la[i];
	else {
		la[2*i] += la[i];
		la[2*i + 1] += la[i];
	} 
	la[i] = 0;
}
void update(int i, int l, int r, int a, int b, int val)	{
	true_val(i, l, r);
	if(l > r || r < a || l > b) return;
	if(a <= l && r <= b)	{
		la[i] += val;
		return;
	}
	int mid = (l + r) / 2;
	update(2*i, l, mid, a, b, val); update(2*i + 1, mid + 1, r, a, b, val);
}
void getm(int i, int l, int r, int pos)	{
	true_val(i, l, r);
	if(l > pos || pos > r) return;
	if(l == r) return;
	int mid = (l + r) / 2;
	getm(2*i, l, mid, pos); getm(2*i + 1, mid + 1, r, pos);
}
signed main()
{
	//freopen("test.txt", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> q >> de >> inc;
	for(int i = 0; i <= n; ++i) cin >> node[i];
	for(int i = 0; i < n; ++i){
		if(node[i + 1] > node[i]) sum -= de*(node[i + 1] - node[i]);
		else sum += inc*(node[i] - node[i + 1]);
	}
	//cout << sum << '\n';
	while(q --)	{
		int l, r, val; cin >> l >> r >> val;
		if(l > 0) 	{
			getm(1, 0, n, l - 1);
			getm(1, 0, n, l);
			if(node[l] > node[l - 1]) sum += de*(node[l] - node[l - 1]);
			else sum -= inc*(node[l - 1] - node[l]);
		}
		if(r < n) {
			getm(1, 0, n, r + 1);
			getm(1, 0, n, r);
			if(node[r] < node[r + 1]) sum += de*(node[r + 1] - node[r]);
			else sum -= inc*( -node[r + 1] + node[r]);
		}
		update(1, 0, n, l, r, val);
		if(l > 0) 	{
			getm(1, 0, n, l);
			if(l > 0){
				if(node[l] > node[l - 1]) sum -= de*(node[l] - node[l - 1]);
				else sum += inc*(node[l - 1] - node[l]);
			}
		}
		if(r < n) {
			getm(1, 0, n, r);
			if(r < n){
				if(node[r] < node[r + 1]) sum -= de*(node[r + 1] - node[r]);
				else sum += inc*(node[r] - node[r + 1]);
			}
		}
		cout << sum << '\n';
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 685 ms 7896 KB Output is correct
2 Correct 729 ms 8448 KB Output is correct
3 Correct 699 ms 8932 KB Output is correct
4 Correct 812 ms 8932 KB Output is correct
5 Correct 731 ms 8932 KB Output is correct
6 Correct 326 ms 8932 KB Output is correct
7 Correct 322 ms 8932 KB Output is correct
8 Correct 502 ms 9132 KB Output is correct
9 Correct 564 ms 9492 KB Output is correct
10 Correct 547 ms 9492 KB Output is correct
11 Correct 436 ms 9492 KB Output is correct
12 Correct 356 ms 9492 KB Output is correct
13 Correct 348 ms 9492 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 8 ms 632 KB Output is correct
3 Correct 9 ms 632 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 7 ms 632 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 9 ms 704 KB Output is correct
8 Correct 6 ms 704 KB Output is correct
9 Correct 6 ms 704 KB Output is correct
10 Correct 6 ms 704 KB Output is correct
11 Correct 6 ms 704 KB Output is correct
12 Correct 6 ms 704 KB Output is correct
13 Correct 6 ms 704 KB Output is correct
14 Correct 6 ms 732 KB Output is correct
15 Correct 6 ms 732 KB Output is correct
16 Correct 5 ms 732 KB Output is correct
17 Correct 5 ms 732 KB Output is correct
18 Correct 7 ms 732 KB Output is correct
19 Correct 2 ms 732 KB Output is correct
20 Correct 2 ms 732 KB Output is correct
21 Correct 3 ms 732 KB Output is correct
22 Correct 685 ms 7896 KB Output is correct
23 Correct 729 ms 8448 KB Output is correct
24 Correct 699 ms 8932 KB Output is correct
25 Correct 812 ms 8932 KB Output is correct
26 Correct 731 ms 8932 KB Output is correct
27 Correct 326 ms 8932 KB Output is correct
28 Correct 322 ms 8932 KB Output is correct
29 Correct 502 ms 9132 KB Output is correct
30 Correct 564 ms 9492 KB Output is correct
31 Correct 547 ms 9492 KB Output is correct
32 Correct 436 ms 9492 KB Output is correct
33 Correct 356 ms 9492 KB Output is correct
34 Correct 348 ms 9492 KB Output is correct
35 Correct 661 ms 9492 KB Output is correct
36 Correct 670 ms 9492 KB Output is correct
37 Correct 742 ms 10140 KB Output is correct
38 Correct 675 ms 10140 KB Output is correct
39 Correct 713 ms 10140 KB Output is correct
40 Correct 856 ms 10140 KB Output is correct
41 Correct 668 ms 10140 KB Output is correct
42 Correct 694 ms 10140 KB Output is correct
43 Correct 662 ms 10140 KB Output is correct
44 Correct 657 ms 10140 KB Output is correct
45 Correct 674 ms 10140 KB Output is correct
46 Correct 763 ms 10140 KB Output is correct
47 Correct 307 ms 10140 KB Output is correct
48 Correct 557 ms 10140 KB Output is correct
49 Correct 669 ms 10140 KB Output is correct
50 Correct 407 ms 10140 KB Output is correct
51 Correct 310 ms 10140 KB Output is correct
52 Correct 441 ms 10140 KB Output is correct