oj.uz

Submission #717933

# Submission time Handle Problem Language Result Execution time Memory
717933 2023-04-02T21:10:57 Z Markomafko972 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 154 ms 5628 KB 
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int n, q, k1, k2, a, z, l, r, d;
ll tren;
ll loga[200005];

void update(int x, int y) {
	x++;
	for (x; x <= n+1; x += x & -x) loga[x] += y;
}

ll query(int x) {
	ll out = 0;
	x++;
	for (x; x > 0; x -= x & -x) out += loga[x];
	return out;	
}

int main () {

	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> q >> k1 >> k2;
	for (int i = 0; i <= n; i++) {
		cin >> a;
		if (i > 0) {
			if (a > z) tren -= k1*(ll)(a-z);
			else tren += k2*(ll)(z-a);
		}
		z = a;
		update(i, a);
		update(i+1, -a);
	}
	
	for (int i = 0; i < q; i++) {
		cin >> l >> r >> d;
		ll br1 = query(l-1);
		ll br2 = query(l);
		if (br1 < br2) tren += k1*(ll)(br2-br1);
		else tren -= k2*(ll)(br1-br2);
		
		if (r+1 <= n) {
			ll br1 = query(r);
			ll br2 = query(r+1);
			if (br1 < br2) tren += k1*(ll)(br2-br1);
			else tren -= k2*(ll)(br1-br2);
		}
		
		update(l, d);
		update(r+1, -d);
		
		br1 = query(l-1);
		br2 = query(l);
		if (br1 < br2) tren -= k1*(ll)(br2-br1);
		else tren += k2*(ll)(br1-br2);
		
		if (r+1 <= n) {
			ll br1 = query(r);
			ll br2 = query(r+1);
			if (br1 < br2) tren -= k1*(ll)(br2-br1);
			else tren += k2*(ll)(br1-br2);
		}
		cout << tren << "\n";
	}

	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void update(int, int)':
foehn_phenomena.cpp:19:7: warning: statement has no effect [-Wunused-value]
   19 |  for (x; x <= n+1; x += x & -x) loga[x] += y;
      |       ^
foehn_phenomena.cpp: In function 'll query(int)':
foehn_phenomena.cpp:25:7: warning: statement has no effect [-Wunused-value]
   25 |  for (x; x > 0; x -= x & -x) out += loga[x];
      |       ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 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 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 3268 KB Output is correct
2 Correct 124 ms 3828 KB Output is correct
3 Correct 129 ms 4508 KB Output is correct
4 Correct 151 ms 3664 KB Output is correct
5 Correct 124 ms 4496 KB Output is correct
6 Correct 86 ms 4840 KB Output is correct
7 Correct 93 ms 4708 KB Output is correct
8 Correct 118 ms 4780 KB Output is correct
9 Correct 121 ms 5004 KB Output is correct
10 Correct 115 ms 3828 KB Output is correct
11 Correct 95 ms 4868 KB Output is correct
12 Correct 92 ms 5252 KB Output is correct
13 Correct 99 ms 5624 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 2 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 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 141 ms 3268 KB Output is correct
23 Correct 124 ms 3828 KB Output is correct
24 Correct 129 ms 4508 KB Output is correct
25 Correct 151 ms 3664 KB Output is correct
26 Correct 124 ms 4496 KB Output is correct
27 Correct 86 ms 4840 KB Output is correct
28 Correct 93 ms 4708 KB Output is correct
29 Correct 118 ms 4780 KB Output is correct
30 Correct 121 ms 5004 KB Output is correct
31 Correct 115 ms 3828 KB Output is correct
32 Correct 95 ms 4868 KB Output is correct
33 Correct 92 ms 5252 KB Output is correct
34 Correct 99 ms 5624 KB Output is correct
35 Correct 141 ms 3412 KB Output is correct
36 Correct 132 ms 4812 KB Output is correct
37 Correct 132 ms 5628 KB Output is correct
38 Correct 138 ms 5452 KB Output is correct
39 Correct 126 ms 5476 KB Output is correct
40 Correct 130 ms 5452 KB Output is correct
41 Correct 131 ms 5276 KB Output is correct
42 Correct 128 ms 5324 KB Output is correct
43 Correct 154 ms 4684 KB Output is correct
44 Correct 129 ms 5036 KB Output is correct
45 Correct 151 ms 4792 KB Output is correct
46 Correct 134 ms 5512 KB Output is correct
47 Correct 89 ms 5396 KB Output is correct
48 Correct 104 ms 5588 KB Output is correct
49 Correct 114 ms 4556 KB Output is correct
50 Correct 93 ms 5456 KB Output is correct
51 Correct 87 ms 5400 KB Output is correct
52 Correct 103 ms 5436 KB Output is correct