oj.uz

Submission #854566

# Submission time Handle Problem Language Result Execution time Memory
854566 2023-09-28T05:25:14 Z becaido Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 78 ms 5716 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 2e5 + 5;

int n, q, s, t;
ll d[SIZE], sum[2];

void solve() {
    cin >> n >> q >> s >> t;
    FOR (i, 0, n) cin >> d[i];
    for (int i = n; i >= 1; i--) d[i] -= d[i - 1];
    FOR (i, 1, n) {
        if (d[i] > 0) sum[0] += d[i];
        else sum[1] += -d[i];
    }
    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;

        if (d[l] > 0) sum[0] -= d[l];
        else sum[1] -= -d[l];
        if (r < n) {
            if (d[r + 1] > 0) sum[0] -= d[r + 1];
            else sum[1] -= -d[r + 1];
        }

        d[l] += k, d[r + 1] -= k;

        if (d[l] > 0) sum[0] += d[l];
        else sum[1] += -d[l];
        if (r < n) {
            if (d[r + 1] > 0) sum[0] += d[r + 1];
            else sum[1] += -d[r + 1];
        }

        cout << -sum[0] * s + sum[1] * t << '\n';
    }
}

int main() {
    Waimai;
    solve();
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 3316 KB Output is correct
2 Correct 70 ms 3920 KB Output is correct
3 Correct 76 ms 4688 KB Output is correct
4 Correct 77 ms 3732 KB Output is correct
5 Correct 67 ms 4432 KB Output is correct
6 Correct 61 ms 4948 KB Output is correct
7 Correct 64 ms 5072 KB Output is correct
8 Correct 72 ms 4880 KB Output is correct
9 Correct 73 ms 5204 KB Output is correct
10 Correct 70 ms 3868 KB Output is correct
11 Correct 59 ms 4948 KB Output is correct
12 Correct 60 ms 5200 KB Output is correct
13 Correct 60 ms 5716 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 508 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 71 ms 3316 KB Output is correct
23 Correct 70 ms 3920 KB Output is correct
24 Correct 76 ms 4688 KB Output is correct
25 Correct 77 ms 3732 KB Output is correct
26 Correct 67 ms 4432 KB Output is correct
27 Correct 61 ms 4948 KB Output is correct
28 Correct 64 ms 5072 KB Output is correct
29 Correct 72 ms 4880 KB Output is correct
30 Correct 73 ms 5204 KB Output is correct
31 Correct 70 ms 3868 KB Output is correct
32 Correct 59 ms 4948 KB Output is correct
33 Correct 60 ms 5200 KB Output is correct
34 Correct 60 ms 5716 KB Output is correct
35 Correct 72 ms 3412 KB Output is correct
36 Correct 72 ms 4908 KB Output is correct
37 Correct 73 ms 5716 KB Output is correct
38 Correct 73 ms 5456 KB Output is correct
39 Correct 73 ms 5380 KB Output is correct
40 Correct 77 ms 5592 KB Output is correct
41 Correct 72 ms 5200 KB Output is correct
42 Correct 73 ms 5484 KB Output is correct
43 Correct 71 ms 4796 KB Output is correct
44 Correct 78 ms 5184 KB Output is correct
45 Correct 69 ms 4972 KB Output is correct
46 Correct 71 ms 5596 KB Output is correct
47 Correct 67 ms 5456 KB Output is correct
48 Correct 64 ms 5700 KB Output is correct
49 Correct 60 ms 4688 KB Output is correct
50 Correct 60 ms 5456 KB Output is correct
51 Correct 63 ms 5660 KB Output is correct
52 Correct 59 ms 5460 KB Output is correct