oj.uz

Submission #46662

# Submission time Handle Problem Language Result Execution time Memory
46662 2018-04-22T13:54:11 Z maksim_gaponov Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 183 ms 7632 KB 
#define _CRT_SECURE_NO_WARNINGS
#ifdef KEK
#define FILE_IN "input.txt"
#define FILE_OUT "output.txt"
#endif
#include <iostream>
#include <cstdlib>
#include <climits>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;

void openFiles() {
#ifdef KEK
	assert(freopen(FILE_IN, "r", stdin));
	assert(freopen(FILE_OUT, "w", stdout));
#endif
}

const int MAXN = 200000 + 10;
ll a[MAXN];
int n, q, s_up, s_down;
ll delta[MAXN];

int sign(ll f) {
	return (f >= 0);
}

int main() {
	openFiles();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> q >> s_up >> s_down;
    n++;
	for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
	ll up_cnt = 0, down_cnt = 0;
	for (int i = 1; i < n; i++) {
        delta[i] = a[i] - a[i - 1];
		if (a[i] > a[i - 1]) {
			up_cnt += delta[i];
		}
		else {
			down_cnt += -delta[i];
		}
	}
	for (int j = 0; j < q; j++) {
		int l, r;
		ll x;
		cin >> l >> r >> x;
		ll left_dist = delta[l];
		ll right_dist = delta[r + 1];
        delta[l] += x;
        delta[r + 1] -= x;
		if (sign(delta[l]) == sign(left_dist)) {
			if (sign(left_dist) == 1) {
				up_cnt += x;
			}
			else {
				down_cnt -= x;
			}
		}
		else {
			if (sign(left_dist) == 1) {
				up_cnt -= left_dist;
				down_cnt += -delta[l];
			}
			else {
				down_cnt -= -left_dist;
				up_cnt += delta[l];
			}
		}
		if (r != n - 1) {
			if (sign(delta[r + 1]) == sign(right_dist)) {
				if (sign(right_dist) == 1) {
					up_cnt -= x;
				}
				else {
					down_cnt += x;
				}
			}
			else {
				if (sign(right_dist) == 1) {
					up_cnt -= right_dist;
					down_cnt += -delta[r + 1];
				}
				else {
					down_cnt -= -right_dist;
					up_cnt += delta[r + 1];
				}
			}
		}
		ll res = down_cnt * s_down - up_cnt * s_up;
		cout << res << "\n";
	}
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 5248 KB Output is correct
2 Correct 147 ms 5792 KB Output is correct
3 Correct 146 ms 6392 KB Output is correct
4 Correct 153 ms 6392 KB Output is correct
5 Correct 144 ms 6400 KB Output is correct
6 Correct 119 ms 6784 KB Output is correct
7 Correct 113 ms 6784 KB Output is correct
8 Correct 145 ms 6784 KB Output is correct
9 Correct 149 ms 7100 KB Output is correct
10 Correct 146 ms 7100 KB Output is correct
11 Correct 123 ms 7100 KB Output is correct
12 Correct 119 ms 7184 KB Output is correct
13 Correct 118 ms 7552 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 532 KB Output is correct
3 Correct 4 ms 636 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 4 ms 704 KB Output is correct
6 Correct 3 ms 780 KB Output is correct
7 Correct 3 ms 780 KB Output is correct
8 Correct 3 ms 780 KB Output is correct
9 Correct 3 ms 780 KB Output is correct
10 Correct 3 ms 784 KB Output is correct
11 Correct 4 ms 828 KB Output is correct
12 Correct 4 ms 828 KB Output is correct
13 Correct 3 ms 828 KB Output is correct
14 Correct 3 ms 828 KB Output is correct
15 Correct 3 ms 828 KB Output is correct
16 Correct 3 ms 872 KB Output is correct
17 Correct 3 ms 872 KB Output is correct
18 Correct 3 ms 872 KB Output is correct
19 Correct 2 ms 872 KB Output is correct
20 Correct 2 ms 872 KB Output is correct
21 Correct 2 ms 872 KB Output is correct
22 Correct 140 ms 5248 KB Output is correct
23 Correct 147 ms 5792 KB Output is correct
24 Correct 146 ms 6392 KB Output is correct
25 Correct 153 ms 6392 KB Output is correct
26 Correct 144 ms 6400 KB Output is correct
27 Correct 119 ms 6784 KB Output is correct
28 Correct 113 ms 6784 KB Output is correct
29 Correct 145 ms 6784 KB Output is correct
30 Correct 149 ms 7100 KB Output is correct
31 Correct 146 ms 7100 KB Output is correct
32 Correct 123 ms 7100 KB Output is correct
33 Correct 119 ms 7184 KB Output is correct
34 Correct 118 ms 7552 KB Output is correct
35 Correct 146 ms 7552 KB Output is correct
36 Correct 146 ms 7552 KB Output is correct
37 Correct 161 ms 7632 KB Output is correct
38 Correct 150 ms 7632 KB Output is correct
39 Correct 144 ms 7632 KB Output is correct
40 Correct 160 ms 7632 KB Output is correct
41 Correct 147 ms 7632 KB Output is correct
42 Correct 183 ms 7632 KB Output is correct
43 Correct 148 ms 7632 KB Output is correct
44 Correct 160 ms 7632 KB Output is correct
45 Correct 138 ms 7632 KB Output is correct
46 Correct 144 ms 7632 KB Output is correct
47 Correct 148 ms 7632 KB Output is correct
48 Correct 115 ms 7632 KB Output is correct
49 Correct 136 ms 7632 KB Output is correct
50 Correct 125 ms 7632 KB Output is correct
51 Correct 131 ms 7632 KB Output is correct
52 Correct 140 ms 7632 KB Output is correct