oj.uz

Submission #68223

# Submission time Handle Problem Language Result Execution time Memory
68223 2018-08-16T09:01:01 Z Nurlykhan Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 842 ms 7572 KB 
#include <bits/stdc++.h>

#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
#define pii pair<int, int>
#define mp make_pair
#define f first
#define ll long long
#define ld long double
#define s second
#define vec vector<int>

using namespace std;

const int N = (int) 2e5 + 10;
const int M = (int) 2018 * 2018;
const int K = (int) 15;
const int INF = (int) 1e9 + 7;
const int mod = (int) 998244353;
const ld EPS = (ld) 1e-9;
const ll LINF = (ll) 1e18;

int n, q;
ll s, t;
ll a[N], b[N];
ll sum;

void upd(int id, int val) {
	if (b[id] > 0) {
		sum += b[id] * s;
	} else {
		sum += b[id] * t;
	}
	b[id] += val;
	if (b[id] > 0) {
		sum -= b[id] * s;
	} else {
		sum -= b[id] * t;
	}
}

int main() {
	#ifdef sony
		freopen("input.txt", "r", stdin);
		freopen("output.txt", "w", stdout);
	#endif
	srand(time(0));
	cin >> n >> q >> s >> t;
	for (int i = 0; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		upd(i, a[i] - a[i - 1]);
	}
	while (q--) {
		int l, r, x;
		cin >> l >> r >> x;
		upd(l, x);
		if (r < n) 
			upd(r + 1, -x);
		cout << sum << endl;
	}
	return 0;	
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 795 ms 5204 KB Output is correct
2 Correct 782 ms 5848 KB Output is correct
3 Correct 723 ms 6324 KB Output is correct
4 Correct 675 ms 6324 KB Output is correct
5 Correct 787 ms 6324 KB Output is correct
6 Correct 685 ms 6756 KB Output is correct
7 Correct 712 ms 6756 KB Output is correct
8 Correct 720 ms 6756 KB Output is correct
9 Correct 781 ms 6916 KB Output is correct
10 Correct 842 ms 6916 KB Output is correct
11 Correct 742 ms 6916 KB Output is correct
12 Correct 717 ms 7168 KB Output is correct
13 Correct 709 ms 7492 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 380 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 11 ms 708 KB Output is correct
4 Correct 12 ms 708 KB Output is correct
5 Correct 10 ms 708 KB Output is correct
6 Correct 12 ms 708 KB Output is correct
7 Correct 12 ms 784 KB Output is correct
8 Correct 10 ms 784 KB Output is correct
9 Correct 10 ms 784 KB Output is correct
10 Correct 12 ms 784 KB Output is correct
11 Correct 10 ms 784 KB Output is correct
12 Correct 9 ms 792 KB Output is correct
13 Correct 9 ms 792 KB Output is correct
14 Correct 9 ms 792 KB Output is correct
15 Correct 9 ms 792 KB Output is correct
16 Correct 10 ms 792 KB Output is correct
17 Correct 10 ms 792 KB Output is correct
18 Correct 9 ms 792 KB Output is correct
19 Correct 2 ms 792 KB Output is correct
20 Correct 3 ms 792 KB Output is correct
21 Correct 3 ms 792 KB Output is correct
22 Correct 795 ms 5204 KB Output is correct
23 Correct 782 ms 5848 KB Output is correct
24 Correct 723 ms 6324 KB Output is correct
25 Correct 675 ms 6324 KB Output is correct
26 Correct 787 ms 6324 KB Output is correct
27 Correct 685 ms 6756 KB Output is correct
28 Correct 712 ms 6756 KB Output is correct
29 Correct 720 ms 6756 KB Output is correct
30 Correct 781 ms 6916 KB Output is correct
31 Correct 842 ms 6916 KB Output is correct
32 Correct 742 ms 6916 KB Output is correct
33 Correct 717 ms 7168 KB Output is correct
34 Correct 709 ms 7492 KB Output is correct
35 Correct 786 ms 7492 KB Output is correct
36 Correct 699 ms 7492 KB Output is correct
37 Correct 701 ms 7572 KB Output is correct
38 Correct 777 ms 7572 KB Output is correct
39 Correct 702 ms 7572 KB Output is correct
40 Correct 671 ms 7572 KB Output is correct
41 Correct 675 ms 7572 KB Output is correct
42 Correct 755 ms 7572 KB Output is correct
43 Correct 724 ms 7572 KB Output is correct
44 Correct 714 ms 7572 KB Output is correct
45 Correct 687 ms 7572 KB Output is correct
46 Correct 782 ms 7572 KB Output is correct
47 Correct 633 ms 7572 KB Output is correct
48 Correct 662 ms 7572 KB Output is correct
49 Correct 693 ms 7572 KB Output is correct
50 Correct 767 ms 7572 KB Output is correct
51 Correct 748 ms 7572 KB Output is correct
52 Correct 680 ms 7572 KB Output is correct