oj.uz

Submission #982369

# Submission time Handle Problem Language Result Execution time Memory
982369 2024-05-14T07:31:14 Z Amirreza_Fakhri Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 147 ms 16352 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 2e5+5;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, q, s, t, a[maxn], d[maxn], seg[maxn*2];

int f(int x, int y) {
    if (x < y) return -s*(y-x);
    return t*(x-y);
}

void upd(int l, int r, int x) {
    for (l += n+1, r += n+1; l < r; l /= 2, r /= 2) {
        if (l&1) seg[l++] += x;
        if (r&1) seg[--r] += x;
    }
}

int get(int i) {
    int res = 0;
    for (i += n+1; i; i /= 2) res += seg[i];
    return res;
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q >> s >> t;
    int ans = 0;
    cin >> a[0];
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        ans += (d[i] = f(a[i-1], a[i]));
    }
    while (q--) {
        int l, r, x; cin >> l >> r >> x;
        upd(l, r+1, x);
        ans -= d[l]+d[r+1];
        ans += (d[l] = f(a[l-1]+get(l-1), a[l]+get(l)));
        if (r != n) ans += (d[r+1] = f(a[r]+get(r), a[r+1]+get(r+1)));
        cout << ans << '\n';
        // for (int i = 0; i <= n; i++) cout << a[i]+get(i) << ' ';
        // cout << '\n';
    }
    return 0;
}





/*
srand(time(0));
cout << (rand()%1900) + 1 << ' ' << (rand()%2)+5 << '\n';
*/

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 8020 KB Output is correct
2 Correct 147 ms 8560 KB Output is correct
3 Correct 113 ms 9220 KB Output is correct
4 Correct 119 ms 14116 KB Output is correct
5 Correct 116 ms 15116 KB Output is correct
6 Correct 79 ms 14092 KB Output is correct
7 Correct 84 ms 14116 KB Output is correct
8 Correct 115 ms 14932 KB Output is correct
9 Correct 114 ms 15296 KB Output is correct
10 Correct 125 ms 14108 KB Output is correct
11 Correct 76 ms 13996 KB Output is correct
12 Correct 77 ms 14676 KB Output is correct
13 Correct 77 ms 14932 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 2664 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 111 ms 8020 KB Output is correct
23 Correct 147 ms 8560 KB Output is correct
24 Correct 113 ms 9220 KB Output is correct
25 Correct 119 ms 14116 KB Output is correct
26 Correct 116 ms 15116 KB Output is correct
27 Correct 79 ms 14092 KB Output is correct
28 Correct 84 ms 14116 KB Output is correct
29 Correct 115 ms 14932 KB Output is correct
30 Correct 114 ms 15296 KB Output is correct
31 Correct 125 ms 14108 KB Output is correct
32 Correct 76 ms 13996 KB Output is correct
33 Correct 77 ms 14676 KB Output is correct
34 Correct 77 ms 14932 KB Output is correct
35 Correct 115 ms 13648 KB Output is correct
36 Correct 119 ms 15020 KB Output is correct
37 Correct 126 ms 15920 KB Output is correct
38 Correct 119 ms 15716 KB Output is correct
39 Correct 130 ms 15504 KB Output is correct
40 Correct 129 ms 15880 KB Output is correct
41 Correct 139 ms 15732 KB Output is correct
42 Correct 117 ms 15444 KB Output is correct
43 Correct 127 ms 15112 KB Output is correct
44 Correct 118 ms 15148 KB Output is correct
45 Correct 115 ms 15296 KB Output is correct
46 Correct 139 ms 16352 KB Output is correct
47 Correct 80 ms 14748 KB Output is correct
48 Correct 78 ms 14704 KB Output is correct
49 Correct 146 ms 13896 KB Output is correct
50 Correct 77 ms 14420 KB Output is correct
51 Correct 90 ms 14940 KB Output is correct
52 Correct 84 ms 14620 KB Output is correct