#include <bits/stdc++.h>
using namespace std;
#define int long long
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a-1); i >= b; --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)
#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, (v))
#define fi first
#define se second
const long long BIG = 1000000000000000000LL;
typedef long long ll;
typedef long double ld;
void cpr(string s, vector<int> v)
{ int i = 0; for (char c : s) { if (c == '$') cout << v[i++]; else cout << c; } cout << '\n'; }
void cpr(string s) { cpr(s, {}); }
void solve();
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
const int borne = 201*1000;
int nbMaisons, nbReq, mont, desc;
int deltas[borne];
int curTemp = 0;
void add(int i, int x)
{
int avant = deltas[i];
int apres = avant+x;
if (avant < 0) {
curTemp -= mont*avant;
} else {
curTemp -= desc*avant;
}
if (apres < 0) {
curTemp += mont*apres;
} else {
curTemp += desc*apres;
}
deltas[i] = apres;
}
void solve()
{
cin >> nbMaisons >> nbReq >> mont >> desc;
int prev = 0;
cin >> prev;
form(i, nbMaisons) {
int alt;
cin >> alt;
deltas[i] = -(alt - prev);
prev = alt;
}
form(i, nbMaisons) {
if (deltas[i] < 0) { // a[i] < a[i+1]
curTemp += mont*deltas[i];
} else {
curTemp += desc*deltas[i];
}
}
form(i, nbReq) {
int l, r, x;
cin >> l >> r >> x;
if (l != 0) add(l-1, -x);
if (r != nbMaisons) add(r, x);
cout << curTemp << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
392 KB |
Output is correct |
3 |
Correct |
3 ms |
480 KB |
Output is correct |
4 |
Correct |
3 ms |
504 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
4 ms |
504 KB |
Output is correct |
7 |
Correct |
3 ms |
428 KB |
Output is correct |
8 |
Correct |
3 ms |
504 KB |
Output is correct |
9 |
Correct |
3 ms |
380 KB |
Output is correct |
10 |
Correct |
3 ms |
504 KB |
Output is correct |
11 |
Correct |
3 ms |
376 KB |
Output is correct |
12 |
Correct |
3 ms |
504 KB |
Output is correct |
13 |
Correct |
3 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
376 KB |
Output is correct |
15 |
Correct |
3 ms |
376 KB |
Output is correct |
16 |
Correct |
3 ms |
376 KB |
Output is correct |
17 |
Correct |
3 ms |
504 KB |
Output is correct |
18 |
Correct |
3 ms |
504 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
118 ms |
8824 KB |
Output is correct |
2 |
Correct |
117 ms |
9436 KB |
Output is correct |
3 |
Correct |
117 ms |
9944 KB |
Output is correct |
4 |
Correct |
112 ms |
9324 KB |
Output is correct |
5 |
Correct |
121 ms |
10524 KB |
Output is correct |
6 |
Correct |
96 ms |
9464 KB |
Output is correct |
7 |
Correct |
94 ms |
9436 KB |
Output is correct |
8 |
Correct |
118 ms |
10296 KB |
Output is correct |
9 |
Correct |
161 ms |
10616 KB |
Output is correct |
10 |
Correct |
123 ms |
9336 KB |
Output is correct |
11 |
Correct |
91 ms |
9440 KB |
Output is correct |
12 |
Correct |
115 ms |
10104 KB |
Output is correct |
13 |
Correct |
101 ms |
10360 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
392 KB |
Output is correct |
3 |
Correct |
3 ms |
480 KB |
Output is correct |
4 |
Correct |
3 ms |
504 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
4 ms |
504 KB |
Output is correct |
7 |
Correct |
3 ms |
428 KB |
Output is correct |
8 |
Correct |
3 ms |
504 KB |
Output is correct |
9 |
Correct |
3 ms |
380 KB |
Output is correct |
10 |
Correct |
3 ms |
504 KB |
Output is correct |
11 |
Correct |
3 ms |
376 KB |
Output is correct |
12 |
Correct |
3 ms |
504 KB |
Output is correct |
13 |
Correct |
3 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
376 KB |
Output is correct |
15 |
Correct |
3 ms |
376 KB |
Output is correct |
16 |
Correct |
3 ms |
376 KB |
Output is correct |
17 |
Correct |
3 ms |
504 KB |
Output is correct |
18 |
Correct |
3 ms |
504 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
22 |
Correct |
118 ms |
8824 KB |
Output is correct |
23 |
Correct |
117 ms |
9436 KB |
Output is correct |
24 |
Correct |
117 ms |
9944 KB |
Output is correct |
25 |
Correct |
112 ms |
9324 KB |
Output is correct |
26 |
Correct |
121 ms |
10524 KB |
Output is correct |
27 |
Correct |
96 ms |
9464 KB |
Output is correct |
28 |
Correct |
94 ms |
9436 KB |
Output is correct |
29 |
Correct |
118 ms |
10296 KB |
Output is correct |
30 |
Correct |
161 ms |
10616 KB |
Output is correct |
31 |
Correct |
123 ms |
9336 KB |
Output is correct |
32 |
Correct |
91 ms |
9440 KB |
Output is correct |
33 |
Correct |
115 ms |
10104 KB |
Output is correct |
34 |
Correct |
101 ms |
10360 KB |
Output is correct |
35 |
Correct |
117 ms |
8824 KB |
Output is correct |
36 |
Correct |
141 ms |
10392 KB |
Output is correct |
37 |
Correct |
124 ms |
11060 KB |
Output is correct |
38 |
Correct |
118 ms |
10872 KB |
Output is correct |
39 |
Correct |
115 ms |
10908 KB |
Output is correct |
40 |
Correct |
120 ms |
10828 KB |
Output is correct |
41 |
Correct |
122 ms |
10620 KB |
Output is correct |
42 |
Correct |
119 ms |
10872 KB |
Output is correct |
43 |
Correct |
120 ms |
10104 KB |
Output is correct |
44 |
Correct |
146 ms |
10592 KB |
Output is correct |
45 |
Correct |
122 ms |
10576 KB |
Output is correct |
46 |
Correct |
127 ms |
11512 KB |
Output is correct |
47 |
Correct |
103 ms |
10104 KB |
Output is correct |
48 |
Correct |
99 ms |
10104 KB |
Output is correct |
49 |
Correct |
105 ms |
9080 KB |
Output is correct |
50 |
Correct |
99 ms |
9844 KB |
Output is correct |
51 |
Correct |
93 ms |
10232 KB |
Output is correct |
52 |
Correct |
94 ms |
10104 KB |
Output is correct |