oj.uz

Submission #960433

# Submission time Handle Problem Language Result Execution time Memory
960433 2024-04-10T12:59:03 Z AeonARY Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 112 ms 15440 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 3 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2400 KB Output is correct
4 Correct 2 ms 2532 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2528 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 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 2396 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 13396 KB Output is correct
2 Correct 112 ms 14164 KB Output is correct
3 Correct 103 ms 14680 KB Output is correct
4 Correct 97 ms 14076 KB Output is correct
5 Correct 101 ms 15184 KB Output is correct
6 Correct 79 ms 14524 KB Output is correct
7 Correct 72 ms 14188 KB Output is correct
8 Correct 97 ms 15188 KB Output is correct
9 Correct 102 ms 15440 KB Output is correct
10 Correct 104 ms 14148 KB Output is correct
11 Correct 73 ms 14228 KB Output is correct
12 Incorrect 69 ms 14804 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2400 KB Output is correct
4 Correct 2 ms 2532 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2528 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 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 2396 KB Output is correct
22 Correct 103 ms 13396 KB Output is correct
23 Correct 112 ms 14164 KB Output is correct
24 Correct 103 ms 14680 KB Output is correct
25 Correct 97 ms 14076 KB Output is correct
26 Correct 101 ms 15184 KB Output is correct
27 Correct 79 ms 14524 KB Output is correct
28 Correct 72 ms 14188 KB Output is correct
29 Correct 97 ms 15188 KB Output is correct
30 Correct 102 ms 15440 KB Output is correct
31 Correct 104 ms 14148 KB Output is correct
32 Correct 73 ms 14228 KB Output is correct
33 Incorrect 69 ms 14804 KB Output isn't correct
34 Halted 0 ms 0 KB -