oj.uz

Submission #960438

# Submission time Handle Problem Language Result Execution time Memory
960438 2024-04-10T13:09:51 Z AeonARY Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 159 ms 11856 KB 
#include <bits/stdc++.h>
using namespace std;

#define Task "DATA"
#define ll 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));
}

int 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 'int main()':
foehn_phenomena.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(Task".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
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".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 3 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 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 6492 KB Output is correct
16 Correct 2 ms 6488 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 6492 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10200 KB Output is correct
2 Correct 110 ms 10660 KB Output is correct
3 Correct 118 ms 11396 KB Output is correct
4 Correct 102 ms 10580 KB Output is correct
5 Correct 159 ms 11384 KB Output is correct
6 Correct 80 ms 11780 KB Output is correct
7 Correct 90 ms 11776 KB Output is correct
8 Correct 101 ms 11604 KB Output is correct
9 Correct 106 ms 11856 KB Output is correct
10 Correct 104 ms 10768 KB Output is correct
11 Correct 77 ms 11600 KB Output is correct
12 Incorrect 71 ms 11852 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 3 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 3 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 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 6492 KB Output is correct
16 Correct 2 ms 6488 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 6492 KB Output is correct
22 Correct 102 ms 10200 KB Output is correct
23 Correct 110 ms 10660 KB Output is correct
24 Correct 118 ms 11396 KB Output is correct
25 Correct 102 ms 10580 KB Output is correct
26 Correct 159 ms 11384 KB Output is correct
27 Correct 80 ms 11780 KB Output is correct
28 Correct 90 ms 11776 KB Output is correct
29 Correct 101 ms 11604 KB Output is correct
30 Correct 106 ms 11856 KB Output is correct
31 Correct 104 ms 10768 KB Output is correct
32 Correct 77 ms 11600 KB Output is correct
33 Incorrect 71 ms 11852 KB Output isn't correct
34 Halted 0 ms 0 KB -