oj.uz

Submission #960442

# Submission time Handle Problem Language Result Execution time Memory
960442 2024-04-10T13:11:40 Z AeonARY Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 130 ms 18376 KB 
#include <bits/stdc++.h>
using namespace std;

#define Task "DATA"
#define ll long long
#define int long long
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)

const int N = 1e6 + 6;
const int INF = 1e9;
const int MOD = 1e9 + 7;

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

void update(int idx, int val) {
    while (idx < N) {
        fen[idx] += val;
        idx += (idx & -idx);
    }
}

ll get(int idx) {
    ll res = 0;
    while (idx >= 1) {
        res += fen[idx];
        idx -= (idx & -idx);
    }
    return res;
}

ll cost(int x, int y) {
    return (y > x ? -s * (y - x) : t * (x - y));
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(Task".INP", "r")) {
        freopen(Task".INP", "r", stdin);
        freopen(Task".OUT", "w", stdout);
    }

    cin >> n >> q >> s >> t;
    FOR(i, 0, n) cin >> a[i];

    ll ans = 0;
    FOR(i, 1, n) {
        update(i, a[i]);
        update(i + 1, -a[i]);
        ans += cost(a[i - 1], a[i]);
    }

    while (q--) {
        int l, r, x;
        cin >> l >> r >> x;

        ans -= cost(get(l - 1), get(l));
        update(l, x);
        ans += cost(get(l - 1), get(l));

        if (r + 1 <= n) {
            ans -= cost(get(r), get(r + 1));
            update(r + 1, -x);
            ans += cost(get(r), get(r + 1));
        }

        cout << ans << "\n";
    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int32_t main()':
foehn_phenomena.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(Task".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         freopen(Task".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 10160 KB Output is correct
2 Correct 102 ms 10760 KB Output is correct
3 Correct 103 ms 11344 KB Output is correct
4 Correct 98 ms 10532 KB Output is correct
5 Correct 117 ms 11348 KB Output is correct
6 Correct 72 ms 11580 KB Output is correct
7 Correct 72 ms 11688 KB Output is correct
8 Correct 101 ms 11728 KB Output is correct
9 Correct 98 ms 11892 KB Output is correct
10 Correct 99 ms 10576 KB Output is correct
11 Correct 78 ms 11600 KB Output is correct
12 Correct 73 ms 12204 KB Output is correct
13 Correct 73 ms 17172 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 3 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6608 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6488 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 1 ms 6488 KB Output is correct
22 Correct 108 ms 10160 KB Output is correct
23 Correct 102 ms 10760 KB Output is correct
24 Correct 103 ms 11344 KB Output is correct
25 Correct 98 ms 10532 KB Output is correct
26 Correct 117 ms 11348 KB Output is correct
27 Correct 72 ms 11580 KB Output is correct
28 Correct 72 ms 11688 KB Output is correct
29 Correct 101 ms 11728 KB Output is correct
30 Correct 98 ms 11892 KB Output is correct
31 Correct 99 ms 10576 KB Output is correct
32 Correct 78 ms 11600 KB Output is correct
33 Correct 73 ms 12204 KB Output is correct
34 Correct 73 ms 17172 KB Output is correct
35 Correct 103 ms 15696 KB Output is correct
36 Correct 110 ms 17184 KB Output is correct
37 Correct 111 ms 18000 KB Output is correct
38 Correct 115 ms 17680 KB Output is correct
39 Correct 112 ms 17840 KB Output is correct
40 Correct 108 ms 17744 KB Output is correct
41 Correct 125 ms 17488 KB Output is correct
42 Correct 120 ms 17600 KB Output is correct
43 Correct 106 ms 16900 KB Output is correct
44 Correct 130 ms 17236 KB Output is correct
45 Correct 103 ms 17436 KB Output is correct
46 Correct 110 ms 18376 KB Output is correct
47 Correct 79 ms 16876 KB Output is correct
48 Correct 84 ms 16976 KB Output is correct
49 Correct 99 ms 15952 KB Output is correct
50 Correct 81 ms 16716 KB Output is correct
51 Correct 82 ms 17264 KB Output is correct
52 Correct 85 ms 17016 KB Output is correct